Simple type inference for term graph rewriting systems
From MaRDI portal
Publication:5881175
DOI10.1007/3-540-56393-8_4MaRDI QIDQ5881175
Publication date: 9 March 2023
Published in: Conditional Term Rewriting Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-56393-8_4
68Q42: Grammars and rewriting systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Type inference for polymorphic references
- Co-induction in relational semantics
- A theory of type polymorphism in programming
- Transfinite reductions in orthogonal term rewriting systems
- Redex capturing in term graph rewriting (concise version)
- The Principal Type-Scheme of an Object in Combinatory Logic