Pages that link to "Item:Q3727946"

The following pages link to Introduction to higher order categorical logic (Q3727946):

Displaying 50 items.

• Glivenko and Kuroda for simple type theory (Q2921007) (← links)
• Can a Quantum Computer Run the von Neumann Architecture? (Q3000932) (← links)
• CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS (Q3005995) (← links)
• The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← links)
• Generality of proofs and its Brauerian representation (Q3160565) (← links)
• A combinatory account of internal structure (Q3173527) (← links)
• Cartesian Monoids (Q3178269) (← links)
• HOL Light: An Overview (Q3183517) (← links)
• Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs (Q3184683) (← links)
• Aspects of higher order categorical logic (Q3342573) (← links)
• (Q3385630) (← links)
• From parametric polymorphism to models of polymorphic FPC (Q3395309) (← links)
• Abstract Beth definability in institutions (Q3410686) (← links)
• (Q3475448) (← links)
• Meeting of the Association for Symbolic Logic, Chicago, 1989 (Q3478382) (← links)
• (Q3483291) (← links)
• On a connection between algebra, logic and linguistics (Q3495524) (← links)
• Interpreting Localized Computational Effects Using Operators of Higher Type (Q3507453) (← links)
• Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness (Q3532471) (← links)
• Relating First-Order Set Theories and Elementary Toposes (Q3533518) (← links)
• A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators (Q3540185) (← links)
• Selection functions, bar recursion and backward induction (Q3559969) (← links)
• Some reasons for generalising domain theory (Q3559971) (← links)
• A Brief Introduction to Algebraic Set Theory (Q3616432) (← links)
• On traced monoidal closed categories (Q3625674) (← links)
• Supra-logic: using transfinite type theory with type variables for paraconsistency (Q3647220) (← links)
• Categorical semantics for higher order polymorphic lambda calculus (Q3783264) (← links)
• Indexed categories for program development (Q3986546) (← links)
• Executable specifications for data-type constructors (Q3986951) (← links)
• The connection between the fundamental groupoid and a unification algorithm for syntactic algebras (Extended abstract) (Q3994022) (← links)
• Coherence of subsumption, minimum typing and type-checking in F ≤ (Q4005456) (← links)
• A new constructive logic: classic logic (Q4006233) (← links)
• Girard quantaloids (Q4006239) (← links)
• Lambek's categorical proof theory and Läuchli's abstract realizability (Q4008758) (← links)
• Provable isomorphisms of types (Q4017461) (← links)
• Compositional characterization of observable program properties (Q4020510) (← links)
• Extending the Curry-Howard interpretation to linear, relevant and other resource logics (Q4032664) (← links)
• Termination and confluence in infinitary term rewriting (Q4254682) (← links)
• The Logic of Bunched Implications (Q4262604) (← links)
• Least fixpoints of endofunctors of cartesian closed categories (Q4279245) (← links)
• The theory of semi-functors (Q4279250) (← links)
• Comprehending monads (Q4279255) (← links)
• Categorical models for non-extensional λ-calculi and combinatory logic (Q4279260) (← links)
• A relativization mechanism in recursion categories (Q4283065) (← links)
• A model for syntactic control of interference (Q4286528) (← links)
• Primitive recursion, equality, and a universal set (Q4322431) (← links)
• Simulating expansions without expansions (Q4322432) (← links)
• Some aspects of categorical logic (Q4325773) (← links)
• The glueing construction and lax limits (Q4327407) (← links)
• On the unification problem for Cartesian closed categories (Q4358059) (← links)