Pages that link to "Item:Q1243117"
From MaRDI portal
The following pages link to LCF considered as a programming language (Q1243117):
Displayed 50 items.
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- Computational foundations of basic recursive function theory (Q1314348) (← links)
- General recursive functions in a very simply interpretable typed \(\lambda\)-calculus (Q1314352) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- A type-theoretical alternative to ISWIM, CUCH, OWHY (Q1314363) (← links)
- Computational adequacy of the FIX-logic (Q1349677) (← links)
- PCF extended with real numbers (Q1349926) (← links)
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- On the Jacopini technique (Q1376416) (← links)
- A general adequacy result for a linear functional language (Q1391860) (← links)
- Degrees of parallelism in the continuous type hierarchy (Q1391861) (← links)
- Term rewriting for normalization by evaluation. (Q1401941) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
- Exact real number computations relative to hereditarily total functionals. (Q1607298) (← links)
- A unary representation result for system \(T\) (Q1817075) (← links)
- Describing semantic domains with sprouts (Q1823713) (← links)
- Two-level languages for program optimization (Q1826626) (← links)
- On the semantics of polymorphism (Q1835664) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- A relative PCF-definability result for strongly stable functions and some corollaries (Q1854294) (← links)
- Relational interpretations of recursive types in an operational setting. (Q1854316) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Integration in Real PCF (Q1854356) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Encoding linear logic with interaction combinators (Q1854547) (← links)
- On inner classes (Q1854553) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
- The origins of structural operational semantics (Q1878710) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Computational adequacy for recursive types in models of intuitionistic set theory (Q1886324) (← links)
- Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150) (← links)
- Projecting sequential algorithms on strongly stable functions (Q1919532) (← links)
- An abstract data type for real numbers (Q1960529) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Semantics of a sequential language for exact real-number computation (Q2373708) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- A stable programming language (Q2492185) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- On a monadic semantics for freshness (Q2566026) (← links)
- Sequential algorithms and strongly stable functions (Q2570134) (← links)
- Interdefinability of parallel operations in PCF (Q2638760) (← links)
- Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
- A domain equation for bisimulation (Q2639646) (← links)
- European Summer Meeting of the Association for Symbolic Logic, Hull, 1986 (Q3030791) (← links)
- Semantical proofs of correctness for programs performing non-deterministic tests on real numbers (Q3060187) (← links)
- The Dedekind reals in abstract Stone duality (Q3395312) (← links)