Minimal and Optimal Computations of Recursive Programs

DOI10.1145/322108.322122MaRDI QIDQ4170199zbMATHOpenAlexFDO

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

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

Cited in

(33)

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

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)