Pages that link to "Item:Q1091379"
From MaRDI portal
The following pages link to The system \({\mathcal F}\) of variable types, fifteen years later (Q1091379):
Displaying 50 items.
- Representations of algebraic domains and algebraic L-domains by information systems (Q276406) (← links)
- Visible acyclic differential nets. I: Semantics (Q409321) (← links)
- The Scott model of linear logic is the extensional collapse of its relational model (Q418011) (← links)
- Internal models of system F for decompilation (Q428882) (← links)
- Preface to the special volume (Q534064) (← links)
- Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← links)
- Linear logic (Q579249) (← links)
- Totality in arena games (Q636307) (← links)
- Comparing models of the intensional typed \(\lambda\)-calculus (Q671646) (← links)
- On maximal stable functions (Q673145) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Equational theories for inductive types (Q678762) (← links)
- Linear logic, coherence and dinaturality (Q685406) (← links)
- Stable domains are generalized topological spaces (Q685417) (← links)
- Forcing in stable models of untyped \(\lambda\)-calculus (Q698623) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- Functorial polymorphism (Q753948) (← links)
- Retractions of dI-domains as a model for Type:Type (Q805221) (← links)
- Prime algebraicity (Q843107) (← links)
- A representation of L-domains by information systems (Q896923) (← links)
- A typed calculus based on a fragment of linear logic (Q908909) (← links)
- Constructive system for automatic program synthesis (Q912589) (← links)
- Alpha conversion, conditions on variables and categorical logic (Q913792) (← links)
- Axioms and models of linear logic (Q915719) (← links)
- An algebraic approach to stable domains (Q917677) (← links)
- Uniformity and the Taylor expansion of ordinary lambda-terms (Q944386) (← links)
- Information systems revisited -- the general continuous case (Q949623) (← links)
- Typed lambda calculi and applications. 9th international conference, TLCA 2009, Brasilia, Brazil, July 1--3, 2009. Proceedings (Q1027645) (← links)
- Normal functors, power series and \(\lambda\)-calculus (Q1103618) (← links)
- A quantitative interpretation of Girard's System F (Q1107514) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Between constructive mathematics and PROLOG (Q1173742) (← links)
- Inheritance as implicit coercion (Q1175335) (← links)
- Coherence spaces are untopological (Q1178707) (← links)
- Finite type structures within combinatory algebras (Q1182485) (← links)
- Stable neighbourhoods (Q1185012) (← links)
- Quantitative domains and infinitary algebras (Q1185015) (← links)
- Program development in constructive type theory (Q1190474) (← links)
- Categorical models of polymorphism (Q1193592) (← links)
- The extended calculus of constructions (ECC) with inductive types (Q1193601) (← links)
- Total sets and objects in domain theory (Q1210138) (← links)
- Coherence and consistency in domains (Q1262787) (← links)
- Categories of embeddings (Q1263665) (← links)
- An algebraic generalization of Frege structures -- binding algebras (Q1274449) (← links)
- The \(HOL\) logic extended with quantification over type variables (Q1309243) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- A natural semantics of first-order type dependency (Q1314402) (← links)
- Full intuitionistic linear logic (Q1314646) (← links)
