From compactifying lambda-letrec terms to recognizing regular-expression processes (extended abstract and literature)

DOI10.4204/EPTCS.408.2MaRDI QIDQ6934059zbMATH OpenFDO

Authors Clemens Armin Grabmayer

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.408.2

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• (Leftmost-outermost) beta reduction is invariant, indeed
• A characterization of regular expressions under bisimulation
• A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
• A complete inference system for a class of regular behaviours
• A complete proof system for 1-free regular expressions modulo bisimilarity
• An Equational Axiomatization of Bisimulation over Regular Expressions
• Axiomatizations for the perpetual loop in process algebra
• Expressibility in the lambda calculus with
• From compactifying lambda-letrec terms to recognizing regular-expression processes (extended abstract and literature)
• scientific article; zbMATH DE number 7456061 (Why is no real title available?)
• scientific article; zbMATH DE number 7774242 (Why is no real title available?)
• Lambda-dropping: Transforming recursive equations into programs with block structure
• Maximal sharing in the lambda calculus with letrec
• Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
• Modeling terms by graphs with structure constraints (two illustrations)
• Nested term graphs (work in progress)
• Partial derivatives of regular expressions and finite automaton constructions
• Proceedings of the 7th international workshop on computing with terms and graphs, TERMGRAPH 2013, Rome, Italy, March, 23, 2013
• Reducibility between classes of port graph grammar.
• Rewriting Techniques and Applications
• Two Complete Axiom Systems for the Algebra of Regular Events
• YALE: yet another lambda evaluator based on interaction nets

Cited in

(1)

• From compactifying lambda-letrec terms to recognizing regular-expression processes (extended abstract and literature)

This page was built for publication: From compactifying lambda-letrec terms to recognizing regular-expression processes (extended abstract and literature)

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