Functional programming with combinators

DOI10.1016/S0747-7171(87)80009-3MaRDI QIDQ1098628zbMATH OpenFDO

Authors Jacek Gibert

Publication date 1987

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatory logic and lambda calculus (03B40) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Cites work

• scientific article; zbMATH DE number 3889503 (Why is no real title available?)
• scientific article; zbMATH DE number 3837991 (Why is no real title available?)
• scientific article; zbMATH DE number 3846829 (Why is no real title available?)
• scientific article; zbMATH DE number 3864470 (Why is no real title available?)
• scientific article; zbMATH DE number 3904559 (Why is no real title available?)
• scientific article; zbMATH DE number 3907755 (Why is no real title available?)
• scientific article; zbMATH DE number 3989326 (Why is no real title available?)
• scientific article; zbMATH DE number 3689361 (Why is no real title available?)
• scientific article; zbMATH DE number 3722073 (Why is no real title available?)
• scientific article; zbMATH DE number 3744496 (Why is no real title available?)
• scientific article; zbMATH DE number 3776829 (Why is no real title available?)
• scientific article; zbMATH DE number 3569806 (Why is no real title available?)
• scientific article; zbMATH DE number 3995079 (Why is no real title available?)
• A linear space translation of functional programs to Turner combinators
• A new implementation technique for applicative languages
• Algebras and combinators
• An abstraction algorithm for combinatory logic
• Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs
• Another algorithm for bracket abstraction
• Can programming be liberated from the von Neumann style?
• Categorical combinators
• Dataflow computing and Eager and Lazy evaluations
• Functional programming with combinators
• MULTILISP: a language for concurrent symbolic computation
• More on advice on structuring compilers and proving them correct
• On the Development of the Algebra of Functional Programs
• Recursive functions of symbolic expressions and their computation by machine, Part I
• The lambda calculus, its syntax and semantics
• The use of combinators in translating a purely functional language to low-level data-flow graphs
• What is a model of the lambda calculus?
• \(\lambda\)-definability and recursiveness

Cited in

(1)

• Functional programming with combinators

Describes a project that uses

Uses Software

• Multilisp

This page was built for publication: Functional programming with combinators

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