scientific article
From MaRDI portal
Publication:3862437
zbMath0426.68059MaRDI QIDQ3862437
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (24)
A theory for nondeterminism, parallelism, communication, and concurrency ⋮ Adapting combinator and SECD machines to display snapshots of functional computations ⋮ Semantics and strong sequentially of priority term rewriting systems ⋮ Lambda-hoisting: A transformation technique for fully lazy evaluation of functional programs ⋮ The semantics of lazy functional languages ⋮ A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations ⋮ Obtaining lazy evaluation with continuations in SCHEME ⋮ Fundamental solutions of the eight queens problem ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ Logic and functional programming by retractions : operational semantics ⋮ Explaining the lazy Krivine machine using explicit substitution and addresses ⋮ Applications of coarse-grained dataflow in computational mechanis ⋮ Map theory ⋮ Computational interpretations of linear logic ⋮ fsh—A functional unix command interpreter ⋮ A glimpse into the paradise of combinatory algebra ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine ⋮ Preliminary arrangements of arguments in lazy evaluation ⋮ Primitives for resource management in a demand-driven reduction model ⋮ Semantics and strong sequentiality of priority term rewriting systems ⋮ Functional-logic integration via minimal reciprocal extensions ⋮ Using circular programs to eliminate multiple traversals of data ⋮ Termination analysis for partial functions
This page was built for publication:
