scientific article; zbMATH DE number 3664393

zbMATH Open0426.68059MaRDI QIDQ3862437FDOQ3862437

Authors: Peter B. Henderson 

Publication date: 1980

Title of this publication is not available (Why is that?)

zbMATH Keywords

functional programmingrecursioncompilerinterpreterLISP implementationspure subset of LISP

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of compilers and interpreters (68N20)

Cited In (24)

• Using circular programs to eliminate multiple traversals of data
• The Impact of the Lambda Calculus in Logic and Computer Science
• Computational interpretations of linear logic
• Functional-logic integration via minimal reciprocal extensions
• Explaining the lazy Krivine machine using explicit substitution and addresses
• Map theory
• A theory for nondeterminism, parallelism, communication, and concurrency
• Computability in higher types, P\(\omega\) and the completeness of type assignment
• Termination analysis for partial functions
• Logic and functional programming by retractions : operational semantics
• The semantics of lazy functional languages
• Semantics and strong sequentially of priority term rewriting systems
• A glimpse into the paradise of combinatory algebra
• Semantics and strong sequentiality of priority term rewriting systems
• Fundamental solutions of the eight queens problem
• fsh—A functional unix command interpreter
• Preliminary arrangements of arguments in lazy evaluation
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
• Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs
• Obtaining lazy evaluation with continuations in SCHEME
• Applications of coarse-grained dataflow in computational mechanis
• Primitives for resource management in a demand-driven reduction model
• Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine
• Adapting combinator and SECD machines to display snapshots of functional computations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3862437)