The variable containment problem

DOI10.1007/3-540-61254-8_22zbMath1407.68090OpenAlexW1587530052MaRDI QIDQ4645807

Stefan Kahrs

Publication date: 11 January 2019

Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)

Full work available at URL: https://kar.kent.ac.uk/21244/1/varcont.pdf

zbMATH Keywords

normal formfree variableabstract modelbase typeextra variable

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (4)

Higher-order rewrite systems and their confluence ⋮ Infinitary rewriting: meta-theory and convergence ⋮ Unary PCF is decidable ⋮ Decidability of behavioural equivalence in unary PCF

Uses Software

• Automath

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Higher-order rewrite systems and their confluence
• The undecidability of the second-order unification problem
• Proving and applying program transformations expressed with second-order patterns
• Combinatory reduction systems: Introduction and survey
• Third order matching is decidable
• Introduction to generalized type systems
• Modular aspects of properties of term rewriting systems related to normal forms
• Towards a domain theory for termination proofs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The variable containment problem