A machine-checked proof of the Standardization Theorem in Lambda Calculus using multiple substitution
Incluye bibliografía y anexos.
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | masterThesis |
| Langue: | anglais |
| Publié: |
2018
|
| Sujets: | |
| Accès en ligne: | http://hdl.handle.net/20.500.11968/3725 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires: A machine-checked proof of the Standardization Theorem in Lambda Calculus using multiple substitution
- Normalization Proofs for the Simply-Typed Lambda Calculus in Agda
- On the Formalisation of the Metatheory of the Lambda Calculus and Languages with Binders
- Reasoning about functional programs by combining interactive and automatic proofs
- A machine assisted proof of the subject reduction property for small typed functional language. Master Thesis
- Inferencia de tipos de sesión
- Experiment with a type-theoretic approach to the verification of model transformations