Pages that link to "Item:Q1243117"
From MaRDI portal
The following pages link to LCF considered as a programming language (Q1243117):
Displayed 36 items.
- A Denotational Semantics for Total Correctness of Sequential Exact Real Programs (Q3502663) (← links)
- Interpreting Localized Computational Effects Using Operators of Higher Type (Q3507453) (← links)
- Sequential real number computation and recursive relations (Q3528145) (← links)
- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic (Q3540183) (← links)
- First-Order Universality for Real Programs (Q3576032) (← links)
- A Relational Model of a Parallel and Non-deterministic λ-Calculus (Q3605523) (← links)
- A Fully Abstract Semantics for Constructor Systems (Q3636832) (← links)
- A Process-Model for Linear Programs (Q3638259) (← links)
- Effective λ-models versus recursively enumerable λ-theories (Q3643360) (← links)
- Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages (Q3644934) (← links)
- (Q3912568) (← links)
- Constructive natural deduction and its ‘ω-set’ interpretation (Q4006232) (← links)
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- Fully abstract translations between functional languages (Q4286526) (← links)
- A universality theorem for PCF with recursive types, parallel-or and ∃ (Q4286532) (← links)
- Games and full completeness for multiplicative linear logic (Q4302352) (← links)
- Games and Definability For FPC (Q4372924) (← links)
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic (Q4382500) (← links)
- (Q4513578) (← links)
- (Q4513599) (← links)
- Note on Algol and conservatively extending functional programming (Q4880529) (← links)
- Reference counting as a computational interpretation of linear logic (Q4895551) (← links)
- Introduction to Type Theory (Q5191087) (← links)
- Dependent Types at Work (Q5191088) (← links)
- Constructive set theoretic models of typed combinatory logic (Q5287682) (← links)
- Denotational aspects of untyped normalization by evaluation (Q5313717) (← links)
- On the ubiquity of certain total type structures (Q5430138) (← links)
- From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
- On Natural Non-dcpo Domains (Q5452201) (← links)
- Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
- Strictness, totality, and non-standard-type inference (Q5958293) (← links)
- Two applications of analytic functors (Q5958294) (← links)
- On the construction of stable models of untyped \(\lambda\)-calculus (Q5958611) (← links)
- A typed context calculus (Q5958759) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)
- On the expressive power of first-order boolean functions in PCF (Q5958769) (← links)