scientific article; zbMATH DE number 1332643
From MaRDI portal
Publication:4259970
Recommendations
Cited in
(10)- Reduction and unification in lambda calculi with a general notion of subtype
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
- Comparing and implementing calculi of explicit substitutions with eta-reduction
- Principal Typings for Explicit Substitutions Calculi
- Postponement, conservation and preservation of strong normalization for generalized reduction
- Comparing calculi of explicit substitutions with eta-reduction
- Intersection types and computational rules
- A faithful and quantitative notion of distant reduction for generalized applications
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4259970)