Pages that link to "Item:Q2785696"
From MaRDI portal
The following pages link to Intuitionistic model constructions and normalization proofs (Q2785696):
Displayed 19 items.
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
- Representing model theory in a type-theoretical logical framework (Q654913) (← links)
- Program extraction from normalization proofs (Q817701) (← links)
- Term rewriting for normalization by evaluation. (Q1401941) (← links)
- A Context-based Approach to Proving Termination of Evaluation (Q2805157) (← links)
- The Simple Type Theory of Normalisation by Evaluation (Q2841227) (← links)
- On Normalization by Evaluation for Object Calculi (Q3499758) (← links)
- Big-step normalisation (Q3638919) (← links)
- Typed Applicative Structures and Normalization by Evaluation for System F ω (Q3644739) (← links)
- A general formulation of simultaneous inductive-recursive definitions in type theory (Q4508246) (← links)
- Extracting a proof of coherence for monoidal categories from a proof of normalization for monoids (Q4647569) (← links)
- Internal type theory (Q4647575) (← links)
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs (Q5019018) (← links)
- Categorical reconstruction of a reduction free normalization proof (Q5057474) (← links)
- Normalization by Evaluation for Typed Weak lambda-Reduction (Q5091147) (← links)
- Denotational aspects of untyped normalization by evaluation (Q5313717) (← links)
- A logical framework combining model and proof theory (Q5400853) (← links)
- Semantic analysis of normalisation by evaluation for typed lambda calculus (Q5889884) (← links)
- Normalization by evaluation for modal dependent type theory (Q6065506) (← links)