Minimal and Optimal Computations of Recursive Programs

DOI10.1145/322108.322122MaRDI QIDQ4170199zbMATH OpenOpenAlexFDO

Authors Gérard Berry, Jean-Jacques Lévy

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

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

Cited in

(33)

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

This page was built for publication: Minimal and Optimal Computations of Recursive Programs

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