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

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)

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

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)