Minimal and Optimal Computations of Recursive Programs

DOI10.1145/322108.322122zbMath0388.68012OpenAlexW2025170645MaRDI QIDQ4170199

Jean-Jacques Levy, Gérard Berry

Publication date: 1979

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322108.322122

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40)

Related Items

Connections between a concrete and an abstract model of concurrent systems, An algebraic semantics approach to the effective resolution of type equations, Labelled domains and automata with concurrency, Open problems in rewriting, Optimal normalization in orthogonal term rewriting systems, Needed reduction and spine strategies for the lambda calculus, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, The combinator M and the Mockingbird lattice, Reversing Single Sessions, Unnamed Item, Conditional rewrite rules: Confluence and termination, Concurrent transition systems, Concurrency and atomicity, An algebraic approach to stable domains, Sequential algorithms on concrete data structures, From domains to automata with concurrency, A kleene theorem for recognizable languages over concurrency monoids, Reversible session-based pi-calculus, Sequentiality in orthogonal term rewriting systems, Recognizable languages in concurrency monoids, Infinitary combinatory reduction systems, Rewriting on cyclic structures: Equivalence between the operational and the categorical description, Representation of computations in concurrent automata by dependence orders, Studying Operational Models of Relaxed Concurrency, A proof description language and its reduction system, Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin, Total unfolding: theory and applications, Transformations of structures: An algebraic approach, A short scientific biography of Maurice Nivat, Redexes are stable in the λ-calculus, Relating conflict-free stable transition and event models via redex families, Complexity of the combinator reduction machine