Pages that link to "Item:Q1243117"
From MaRDI portal
The following pages link to LCF considered as a programming language (Q1243117):
Displayed 50 items.
- Semantics for data parallel computation (Q1186098) (← links)
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic (Q1193588) (← links)
- Characterizing complexity classes by higher type primitive recursive definitions (Q1193623) (← links)
- Towards a theory of parallel algorithms on concrete data structures (Q1194326) (← links)
- Confluence of the lambda calculus with left-linear algebraic rewriting (Q1197987) (← links)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) (← links)
- Total sets and objects in domain theory (Q1210138) (← links)
- Completeness results for the equivalence of recursive schemas (Q1232171) (← links)
- Fully abstract models of typed \(\lambda\)-calculi (Q1249567) (← links)
- A syntactic theory of sequential state (Q1263961) (← links)
- Induction and recursion on the partial real line with applications to Real PCF (Q1274810) (← links)
- System \(T\), call-by-value and the minimum problem (Q1274979) (← links)
- Unary PCF is decidable (Q1274980) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Properly injective spaces and function spaces (Q1295213) (← links)
- \({\mathcal M}^\omega\) considered as a programming language (Q1304541) (← links)
- 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)
- Fully abstract trace semantics for protected module architectures (Q1749116) (← 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)