Functional programming with combinators
From MaRDI portal
Publication:1098628
DOI10.1016/S0747-7171(87)80009-3zbMath0637.68041MaRDI QIDQ1098628
Publication date: 1987
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25) Combinatory logic and lambda calculus (03B40)
Related Items (1)
Uses Software
Cites Work
- Dataflow computing and Eager and Lazy evaluations
- Functional programming with combinators
- The lambda calculus, its syntax and semantics
- More on advice on structuring compilers and proving them correct
- Algebras and combinators
- A linear space translation of functional programs to Turner combinators
- \(\lambda\)-definability and recursiveness
- Recursive functions of symbolic expressions and their computation by machine, Part I
- Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs
- The use of combinators in translating a purely functional language to low-level data-flow graphs
- MULTILISP: a language for concurrent symbolic computation
- Categorical combinators
- On the Development of the Algebra of Functional Programs
- An abstraction algorithm for combinatory logic
- Can programming be liberated from the von Neumann style?
- A new implementation technique for applicative languages
- Another algorithm for bracket abstraction
- What is a model of the lambda calculus?
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Functional programming with combinators
