Pages that link to "Item:Q1243117"

The following pages link to LCF considered as a programming language (Q1243117):

Displaying 50 items.

• A stream calculus of bottomed sequences for real number computation (Q265834) (← links)
• Intuitionistic completeness of first-order logic (Q392280) (← links)
• A relational semantics for parallelism and non-determinism in a functional setting (Q408545) (← links)
• The Scott model of linear logic is the extensional collapse of its relational model (Q418011) (← links)
• Constructive Boolean circuits and the exactness of timed ternary simulation (Q453539) (← links)
• Krivine machines and higher-order schemes (Q476196) (← links)
• Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
• Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← links)
• A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
• Abstraction for concurrent objects (Q615951) (← links)
• Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
• Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
• Fully abstract compositional semantics for an algebra of logic programs (Q672703) (← links)
• A uniform treatment of order of evaluation and aggregate update (Q685390) (← links)
• On stable domains (Q685428) (← links)
• Subrecursive hierarchies on Scott domains (Q688507) (← links)
• Partial inductive definitions as type-systems for \(\lambda\)-terms (Q688729) (← links)
• The semantics of second-order lambda calculus (Q751294) (← links)
• Functorial polymorphism (Q753948) (← links)
• Semantics of algorithmic languages (Q760200) (← links)
• Distributive semantics for nondeterministic typed \(\lambda\)-calculi (Q760418) (← links)
• Expressive power of typed and type-free programming languages (Q761790) (← links)
• Computable de Finetti measures (Q764273) (← links)
• The extensional ordering of the sequential functionals (Q764278) (← links)
• From IF to BI. A tale of dependence and separation (Q833040) (← links)
• Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) (← links)
• On the relations between monadic semantics (Q879354) (← links)
• A synthetic axiomatization of map theory (Q906269) (← links)
• Domain interpretations of Martin-Löf's partial type theory (Q916656) (← links)
• A domain model characterising strong normalisation (Q958484) (← links)
• The equational theory of prebisimilarity over basic CCS with divergence (Q975471) (← links)
• Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
• Abstract interface behavior of object-oriented languages with monitors (Q1015384) (← links)
• A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++ (Q1015388) (← links)
• Applications of infinitary lambda calculus (Q1021568) (← links)
• Natural non-dcpo domains and f-spaces (Q1023300) (← links)
• A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
• Structured algebraic specifications: A kernel language (Q1080652) (← links)
• A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
• Toward formal development of programs from algebraic specifications: Implementations revisited (Q1090100) (← links)
• Full abstraction and limiting completeness in equational languages (Q1121676) (← links)
• \(\mathbb{T}^\omega\) as a universal domain (Q1132085) (← links)
• A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949) (← links)
• The IO- and OI-hierarchies (Q1161273) (← links)
• Sequential algorithms on concrete data structures (Q1170880) (← links)
• Domain theory in logical form (Q1174593) (← links)
• Correctness of concurrent processes (Q1176236) (← links)
• About primitive recursive algorithms (Q1176246) (← links)
• Relation algebraic domain constructions (Q1177156) (← links)
• On the expressive power of finitely typed and universally polymorphic recursive procedures (Q1185006) (← links)