Minimal and Optimal Computations of Recursive Programs

From MaRDI portal
Revision as of 11:28, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4170199

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




Related Items (32)

Connections between a concrete and an abstract model of concurrent systemsAn algebraic semantics approach to the effective resolution of type equationsLabelled domains and automata with concurrencyOpen problems in rewritingOptimal normalization in orthogonal term rewriting systemsNeeded reduction and spine strategies for the lambda calculusEquivalences and transformations of regular systems - applications to recursive program schemes and grammarsThe combinator M and the Mockingbird latticeReversing Single SessionsUnnamed ItemConditional rewrite rules: Confluence and terminationConcurrent transition systemsConcurrency and atomicityAn algebraic approach to stable domainsSequential algorithms on concrete data structuresFrom domains to automata with concurrencyA kleene theorem for recognizable languages over concurrency monoidsReversible session-based pi-calculusSequentiality in orthogonal term rewriting systemsRecognizable languages in concurrency monoidsInfinitary combinatory reduction systemsRewriting on cyclic structures: Equivalence between the operational and the categorical descriptionRepresentation of computations in concurrent automata by dependence ordersStudying Operational Models of Relaxed ConcurrencyA proof description language and its reduction systemHistorical introduction to ``Concrete domains by G. Kahn and G. D. PlotkinTotal unfolding: theory and applicationsTransformations of structures: An algebraic approachA short scientific biography of Maurice NivatRedexes are stable in the λ-calculusRelating conflict-free stable transition and event models via redex familiesComplexity of the combinator reduction machine







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