Pages that link to "Item:Q4939699"
From MaRDI portal
The following pages link to Introduction to generalized type systems (Q4939699):
Displayed 17 items.
- The development of a partial evaluator for extended lambda calculus (Q1264617) (← links)
- Constructive proofs of the range property in lambda calculus (Q1314345) (← links)
- Intensional computation with higher-order functions (Q1733061) (← links)
- Programs as data structures in \(\lambda\)SF-calculus (Q1744389) (← links)
- The self-reduction in lambda calculus (Q1978706) (← links)
- Self-quotation in a typed, intensional lambda-calculus (Q2130593) (← links)
- On the Semantics of Intensionality (Q2988392) (← links)
- A Type Theory for Probabilistic $$\lambda $$–calculus (Q3297838) (← links)
- Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms (Q4988930) (← links)
- Open problems in rewriting (Q5055780) (← links)
- Problems in rewriting III (Q5055847) (← links)
- The Implicit Calculus of Constructions as a Programming Language with Dependent Types (Q5458373) (← links)
- The metatheory of UTT (Q6061874) (← links)
- Is Impredicativity Implicitly Implicit (Q6079240) (← links)
- Developing certified programs in the system Coq the program tactic (Q6083698) (← links)
- Codifying guarded definitions with recursive schemes (Q6083895) (← links)
- First among equals: co-hyperintensionality for structured propositions (Q6142500) (← links)