Pages that link to "Item:Q5561939"
From MaRDI portal
The following pages link to Intensional interpretations of functionals of finite type I (Q5561939):
Displaying 50 items.
- Combinatorial realizability models of type theory (Q385804) (← links)
- Semantic types and approximation for Featherweight Java (Q387991) (← links)
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- The Scott model of linear logic is the extensional collapse of its relational model (Q418011) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- Binary trees as a computational framework (Q461478) (← links)
- Linear logical relations and observational equivalences for session-based concurrency (Q476190) (← links)
- Strong normalization from an unusual point of view (Q534700) (← links)
- Cut-elimination in the strict intersection type assignment system is strongly normalizing (Q558418) (← links)
- Normalization and excluded middle. I (Q583185) (← links)
- Higher-order subtyping and its decidability (Q598199) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Nominal abstraction (Q617715) (← links)
- Setting the facts straight (Q626491) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
- Strong normalization of \(\mathsf{ML}^{\mathsf F}\) via a calculus of coercions (Q764331) (← links)
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation (Q831147) (← links)
- Coq formalization of the higher-order recursive path ordering (Q843949) (← links)
- Productivity of stream definitions (Q846366) (← links)
- Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
- The heart of intersection type assignment: Normalisation proofs revisited (Q930869) (← links)
- Typing termination in a higher-order concurrent imperative language (Q979082) (← links)
- A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++ (Q1015388) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- On the implementation of abstract data types by programming language constructs (Q1089793) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949) (← links)
- Polymorphic rewriting conserves algebraic strong normalization (Q1176244) (← links)
- About primitive recursive algorithms (Q1176246) (← links)
- Partial inductive definitions (Q1177153) (← links)
- An intuitionistic theory of types with assumptions of high-arity variables (Q1192333) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
- Theory of proofs (arithmetic and analysis) (Q1260035) (← links)
- System \(T\), call-by-value and the minimum problem (Q1274979) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368) (← links)
- \({\mathcal M}^\omega\) considered as a programming language (Q1304541) (← links)
- Intersection type assignment systems (Q1350344) (← links)
- Strong normalization for non-structural subtyping via saturated sets (Q1351999) (← links)
- Normalization results for typeable rewrite systems (Q1357006) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Termination of system \(F\)-bounded: A complete proof (Q1383151) (← links)
