In this paper we describe a method, based on lazy evaluation, for creating infinite data structures in Ada. We illustrate some potential applications of infinite data structures and describe three different implementation approaches. 1.1 Keywords Ada, functional programming, lazy evaluation, infinite data structures. 2
This thesis investigates the implementation of lazy functional programming languages on parallel mac...
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
AbstractWe elaborate our relational model of non-strict, imperative computations. The theory is exte...
The first stage in developing a preprocessor-based Ada extension for functional programming is a fac...
Title: Functional Data Structures and Algorithms Author: Milan Straka Institute: Computer Science In...
It is well-known that data abstractions are crucial to good software engineering practice. We argue ...
Traditionally, infinite databases were studied as a data model for queries that may contain function...
Lazy evaluation is an evaluation strategy in programming languages. Lazy evaluation delays the evalu...
Various static analyses of functional programming languages that permit infinite data structures ma...
D We develop a natural technique for defining functions in logic, i.e. PROLOG, which directly yields...
Infinite structures are an integral part of computer science as they serve as representations for co...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractWe discuss the use of the lazy evaluation scheme as coding tool in some algebraic manipulati...
Functional languages can be enriched with logic variables to provide new computational features suc...
Programmers need mechanisms to store application specific data that persists multiple program runs. ...
This thesis investigates the implementation of lazy functional programming languages on parallel mac...
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
AbstractWe elaborate our relational model of non-strict, imperative computations. The theory is exte...
The first stage in developing a preprocessor-based Ada extension for functional programming is a fac...
Title: Functional Data Structures and Algorithms Author: Milan Straka Institute: Computer Science In...
It is well-known that data abstractions are crucial to good software engineering practice. We argue ...
Traditionally, infinite databases were studied as a data model for queries that may contain function...
Lazy evaluation is an evaluation strategy in programming languages. Lazy evaluation delays the evalu...
Various static analyses of functional programming languages that permit infinite data structures ma...
D We develop a natural technique for defining functions in logic, i.e. PROLOG, which directly yields...
Infinite structures are an integral part of computer science as they serve as representations for co...
AbstractThis paper is based on a recently developed technique to build debugging tools for lazy func...
AbstractWe discuss the use of the lazy evaluation scheme as coding tool in some algebraic manipulati...
Functional languages can be enriched with logic variables to provide new computational features suc...
Programmers need mechanisms to store application specific data that persists multiple program runs. ...
This thesis investigates the implementation of lazy functional programming languages on parallel mac...
AbstractWe develop a natural technique for defining functions in logic, i.e. PROLOG, which directly ...
AbstractWe elaborate our relational model of non-strict, imperative computations. The theory is exte...
DOI
Add to ORKG