Behavioral semantics of nonrecursive control structures
Programming Symposium, Proceedings Colloque sur la Programmation
MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
PARLOG: parallel programming in logic
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
The concept of a supercompiler
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Overview of concert multilisp: a multiprocessor symbolic computing system
ACM SIGARCH Computer Architecture News
APL function definition notation
APL '87 Proceedings of the international conference on APL: APL in transition
Compiling strictness into streams
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Types and persistence in database programming languages
ACM Computing Surveys (CSUR)
Functional Development of Database Applications
IEEE Transactions on Software Engineering
On the translation of relational queries into iterative programs
ACM Transactions on Database Systems (TODS)
EQL: The Language and its Implementation
IEEE Transactions on Software Engineering
Conception, evolution, and application of functional programming languages
ACM Computing Surveys (CSUR)
A functional model of clocked microarchitectures
MICRO 22 Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture
Completeness of rewrite rules and rewrite strategies for FP
Journal of the ACM (JACM)
Incremental reduction in the lambda calculus
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
On laziness and optimality in lambda interpreters: tools for specification and analysis
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming with Streams in a Pascal-Like Language
IEEE Transactions on Software Engineering
Compiling APL for parallel and vector execution
APL '91 Proceedings of the international conference on APL '91
Two models for integrating persistence and lazy functional languages
ACM SIGPLAN Notices
Full functional programming in a declarative Ada dialect
TRI-Ada '92 Proceedings of the conference on TRI-Ada '92
Sublinear-space evaluation algorithms for attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
DAda—an Ada preprocessor for functional programming
TRI-Ada '90 Proceedings of the conference on TRI-ADA '90
Reusable Ada libraries supporting infinite data structures
Proceedings of the 1998 annual ACM SIGAda international conference on Ada
Denotational semantics and rewrite rules for FP
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An implementation technique for database query languages
ACM Transactions on Database Systems (TODS)
Equations, sets, and reduction semantics for functional and logic programming
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Minimal and Optimal Computations of Recursive Programs
Journal of the ACM (JACM)
Grammars for functional languages
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Lazy rewriting on eager machinery
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data-Driven and Demand-Driven Computer Architecture
ACM Computing Surveys (CSUR)
Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Some Techniques for Recursion Removal from Recursive Functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
User Recovery and Reversal in Interactive Systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
A language for bitmap manipulation
ACM Transactions on Graphics (TOG)
Communications of the ACM
A note on conditional expressions
Communications of the ACM
Compilation and delayed evaluation in APL
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Threshold evaluation and the semantics of call by value, assignment and generic procedures
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Experience with an applicative string processing language
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An indeterminate constructor for applicative programming
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpreter generator using tree pattern matching
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Context-sensitive rewriting strategies
Information and Computation
On the Complexity of Boolean Functions Computed by Lazy Oracles
IEEE Transactions on Computers
Demand-driven logic simulation using a network of loosely coupled processors
Journal of Systems Architecture: the EUROMICRO Journal
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Implementation of an interpreter for abstract equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Treat - an applicative code generator
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Busy and lazy FP with infinite objects
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Super-combinators a new implementation method for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Experiments with a supercompiler
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Nondeterministic call by need is neither lazy nor by name
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Toward an algebra of nondeterministic programs
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
The semantics of lazy (and industrious) evaluation
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
HOPE: An experimental applicative language
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Computing cyclic list structures
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Divide and concer: Data structuring in applicative multiprocessing systems
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Performance of a multiprocessor for Applicative programs
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Recursive programming through table look-up
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Applicative style programming, program transformation, and list operators
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Transformations of FP program schemes
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Applications of feedback in functional programming
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
If-then-else as a concurrency inhibitor in eager beaver evaluation of recursive programs
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Executing functional programs on a virtual tree of processors
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
A practical functional programming system for databases
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Introduction to relational programming
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Attribute grammars and data-flow languages
Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems
Representation of factual information by equations and their evaluation
ICSE '82 Proceedings of the 6th international conference on Software engineering
Aspects of applicative programming for file systems (Preliminary Version)
Proceedings of an ACM conference on Language design for reliable software
Data abstraction, controlled iteration, and communicating processes
ACM '80 Proceedings of the ACM 1980 annual conference
A space improvement in the alternating semantic evaluator
ACM '80 Proceedings of the ACM 1980 annual conference
The call-by-need lambda calculus
Journal of Functional Programming
A functional correspondence between call-by-need evaluators and lazy abstract machines
Information Processing Letters
AL1: a package for generating strategies from tables
ACM SIGART Bulletin
An iterative lisp solution to the samefringe problem
ACM SIGART Bulletin
Understanding performance in coliseum, an immersive videoconferencing system
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A treatment of higher-order features in logic programming
Theory and Practice of Logic Programming
ACM SIGSAM Bulletin
On the static and dynamic extents of delimited continuations
Science of Computer Programming
A history of Haskell: being lazy with class
Proceedings of the third ACM SIGPLAN conference on History of programming languages
ACM Turing award lectures
Aspects of Applicative Programming for Parallel Processing
IEEE Transactions on Computers
The scheme of things: streams versus generators
ACM SIGPLAN Lisp Pointers
Termination of Lazy Rewriting Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Lazy evaluation and delimited control
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Science of Computer Programming
A method for automatically analyzing programs
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
Descriptions as constraints in object-oriented representation
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Global and local space properties of stream programs
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Infinitary Combinatory Reduction Systems
Information and Computation
Lazy execution of model-to-model transformations
Proceedings of the 14th international conference on Model driven engineering languages and systems
Defunctionalized interpreters for call-by-need evaluation
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Theoretical Computer Science
A tactic language for reasoning about Z specifications
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
The call-by-need lambda calculus, revisited
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
On the complexity of equivalence of specifications of infinite objects
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
CARTESIAN STREAM TRANSFORMER COMPOSITION
Fundamenta Informaticae
Formally defining and iterating infinite models
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
A research roadmap towards achieving scalability in model driven engineering
Proceedings of the Workshop on Scalability in Model Driven Engineering
A synthetic operational account of call-by-need evaluation
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.04 |
A different way to execute pure LISP programs is presented. It delays the evaluation of parameters and list structures without ever having to perform more evaluation steps than the usual method. Although the central idea can be found in earlier work this paper is of interest since it treats a rather well-known language and works out an algorithm which avoids full substitution. A partial correctness proof using Scott-Strachey semantics is sketched in a later section.