Pages that link to "Item:Q1243117"
From MaRDI portal
The following pages link to LCF considered as a programming language (Q1243117):
Displayed 50 items.
- 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)
- 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)