Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization
Abstract elided by the publisher.
Related papers
- Termination of rewriting in the Calculus of Constructions JFP 2003
- Shrinking lambda Expressions in Linear Time JFP 1997
- Principality and approximation under dimensional bound POPL 2019
- Type Checking with Rewriting Rules SLE 2024
- Parameter-Passing and the Lambda Calculus POPL 1991
- Modularity of Strong Normalization in the Algebraic-lambda-Cube JFP 1997
- Director Strings as Combinators TOPLAS 1988
- Constraint Patterns As a Basis for Object-Oriented Programming OOPSLA 1992