A theory of binding structures and applications to rewriting
DOI10.1016/0304-3975(93)90240-TzbMATH Open0783.68089OpenAlexW1995328923MaRDI QIDQ685380FDOQ685380
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90240-t
Recommendations
- Fundamentals of compositional rewriting theory
- Automata, Languages and Programming
- A formalized general theory of syntax with bindings
- Structures for abstract rewriting
- A rewriting approach to the combination of data structures with bridging theories
- A formalized general theory of syntax with bindings: extended version
- Publication:4938613
- Pullback rewriting and applications
- scientific article; zbMATH DE number 1118018
- Infinitary rewriting: foundations revisited
rewritinghomomorphismsunificationalgebra of binding structuresfirst-order reasoningstructural recursion
Symbolic computation and algebraic computation (68W30) Data structures (68P05) Applications of universal algebra in computer science (08A70) Theory of computing (68Q99)
Cites Work
- Notions of computation and monads
- Title not available (Why is that?)
- The lambda calculus, its syntax and semantics
- Equivalence in functional languages with effects
- Algebras with a Scheme of Operators
- On the algebraic definition of programming languages
- A logic programming language with lambda-abstraction, function variables, and simple unification
- Title not available (Why is that?)
- Proving and applying program transformations expressed with second-order patterns
- Algebraic construction of compilers
- Inferring the equivalence of functional programs that mutate data
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (13)
- A practical implementation of simple consequence relations using inductive definitions
- A first order logic of effects
- A lambda-calculus for dynamic binding
- A typed context calculus
- An initial algebra approach to term rewriting systems with variable binders
- Combinatory reduction systems: Introduction and survey
- Higher-order substitutions
- Theory and practice of second-order rewriting: foundation, evolution, and SOL
- Title not available (Why is that?)
- Axiomatizing permutation equivalence
- Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
- Labelled reductions, runtime errors, and operational subsumption
- Pullback rewriting and applications
This page was built for publication: A theory of binding structures and applications to rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685380)
