Pages that link to "Item:Q1314363"

The following pages link to A type-theoretical alternative to ISWIM, CUCH, OWHY (Q1314363):

Displaying 50 items.

• A two-valued logic for properties of strict functional programs allowing partial functions (Q352946) (← links)
• N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
• The extensional ordering of the sequential functionals (Q764278) (← links)
• Two categories of effective continuous cpos (Q854182) (← links)
• Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
• On the completeness of order-theoretic models of the \(\lambda \)-calculus (Q1021569) (← links)
• Natural non-dcpo domains and f-spaces (Q1023300) (← links)
• Domain semantics of possibility computations (Q1031684) (← links)
• Proof assistants: history, ideas and future (Q1040001) (← links)
• New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic (Q1193588) (← links)
• Relationships between classes of monotonic functions (Q1235976) (← links)
• Functionals computable in series and in parallel (Q1239155) (← links)
• Induction and recursion on the partial real line with applications to Real PCF (Q1274810) (← links)
• Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
• Properly injective spaces and function spaces (Q1295213) (← links)
• Computational foundations of basic recursive function theory (Q1314348) (← links)
• Formalizing non-termination of recursive programs (Q1349246) (← links)
• A general adequacy result for a linear functional language (Q1391860) (← links)
• Hierarchies of total functionals over the reals (Q1434355) (← links)
• Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
• Exact real number computations relative to hereditarily total functionals. (Q1607298) (← links)
• A monad for randomized algorithms (Q1744376) (← links)
• Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus (Q1813498) (← links)
• The sequentially realizable functionals (Q1849853) (← links)
• The origins of structural operational semantics (Q1878710) (← links)
• An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
• On the \(\lambda Y\) calculus (Q1886326) (← links)
• Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150) (← links)
• Towards formalising Schutz' axioms for Minkowski spacetime in Isabelle/HOL (Q2102946) (← links)
• Densities of almost surely terminating probabilistic programs are differentiable almost everywhere (Q2233472) (← links)
• BISON instantiating the whitened swap-or-not construction (Q2292708) (← links)
• A game-semantic model of computation (Q2319854) (← links)
• A stable programming language (Q2492185) (← links)
• Sequential algorithms and strongly stable functions (Q2570134) (← links)
• Executable Relational Specifications of Polymorphic Type Systems Using Prolog (Q2798266) (← links)
• Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting (Q2805159) (← links)
• Definability and Full Abstraction (Q2864154) (← links)
• HOL Light: An Overview (Q3183517) (← links)
• Fixpoints and Search in PVS (Q3558967) (← links)
• (Q4585074) (← links)
• The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ (Q4637682) (← links)
• Reference counting as a computational interpretation of linear logic (Q4895551) (← links)
• Continuous Domain Theory in Logical Form (Q4922080) (← links)
• Dynamic game semantics (Q4988428) (← links)
• Categorical semantics of a simple differential programming language (Q5019684) (← links)
• Partially ordered objects in a topos (Q5023614) (← links)
• PLANS AND PLANNING IN MATHEMATICAL PROOFS (Q5027672) (← links)
• The Scott model of PCF in univalent type theory (Q5055497) (← links)
• Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)
• Automata, Logic and Games for the $$\lambda $$ -Calculus (Q5224488) (← links)