Similar Items: Extended Initiality for Typed Abstract Syntax
- Constraint solving in non-permutative nominal abstract syntax
- A Fully Abstract Model of PCF Based on Extended Addressing Machines
- On Nominal Syntax and Permutation Fixed Points
- An extended type system with lambda-typed lambda-expressions
- A Functional Abstraction of Typed Invocation Contexts
- Isomorphisms of types in the presence of higher-order references (extended version)