Pages that link to "Item:Q1091379"

The following pages link to The system \({\mathcal F}\) of variable types, fifteen years later (Q1091379):

Displaying 50 items.

• \(QPC_ 2\): A constructive calculus with parameterized specifications (Q1322848) (← links)
• Coherent models of proof nets (Q1325054) (← links)
• Interpreting higher computations as types with totality (Q1337495) (← links)
• Intersection type assignment systems (Q1350344) (← links)
• Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus (Q1356979) (← links)
• Comparing cubes of typed and type assignment systems (Q1365249) (← links)
• Glueing and orthogonality for models of linear logic (Q1398466) (← links)
• System ST toward a type system for extraction and proofs of programs (Q1400600) (← links)
• Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
• Parallel and serial hypercoherences (Q1583243) (← links)
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
• Relational model of second order linear logic (Q1598468) (← links)
• Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
• A computable expression of closure to efficient causation (Q1617623) (← links)
• Strong storage operators and data types (Q1805408) (← links)
• Domain theoretic models of polymorphism (Q1824612) (← links)
• Building continuous webbed models for system F (Q1826624) (← links)
• Encoding types in ML-like languages (Q1826630) (← links)
• Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus (Q1853595) (← links)
• A relative PCF-definability result for strongly stable functions and some corollaries (Q1854294) (← links)
• Order-incompleteness and finite lambda reduction models (Q1884896) (← links)
• Projecting sequential algorithms on strongly stable functions (Q1919532) (← links)
• Semantics of quantum programming languages: Classical control, quantum control (Q2168785) (← links)
• Intersection-types à la Church (Q2381503) (← links)
• Maximality and totality of stable functions in the category of stable bifinite domains (Q2475889) (← links)
• A stable programming language (Q2492185) (← links)
• Quasi-coproducts and accessible categories with wide pullbacks (Q2563764) (← links)
• A higher-order calculus and theory abstraction (Q2639838) (← links)
• Logical Semantics for Stability (Q2805169) (← links)
• Dedekind completion as a method for constructing new Scott domains (Q2841264) (← links)
• (Q2851046) (← links)
• Coherence Spaces and Uniform Continuity (Q2988356) (← links)
• Incremental Update for Graph Rewriting (Q2988640) (← links)
• Principal Types for Nominal Theories (Q3088280) (← links)
• A pluralist approach to the formalisation of mathematics (Q3094181) (← links)
• CPO-models for second order lambda calculus with recursive types and subtyping (Q3142273) (← links)
• (Q3483291) (← links)
• Computation with classical sequents (Q3520146) (← links)
• Rétractions et interprétation interne du polymorphisme : le problème de la rétraction universelle (Q3991293) (← links)
• A new constructive logic: classic logic (Q4006233) (← links)
• Semantics of the second order lambda calculus (Q4006235) (← links)
• The shuffle Hopf algebra and noncommutative full completeness (Q4254690) (← links)
• The interpretation of unsolvable <i>λ</i>-terms in models of untyped <i>λ</i>-calculus (Q4254697) (← links)
• Least fixpoints of endofunctors of cartesian closed categories (Q4279245) (← links)
• Some monoidal closed categories of stable domains and event structures (Q4279246) (← links)
• The theory of semi-functors (Q4279250) (← links)
• From operational semantics to abstract machines (Q4279254) (← links)
• Categorical data types in parametric polymorphism (Q4286531) (← links)
• Games and full completeness for multiplicative linear logic (Q4302352) (← links)
• Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)