LCF considered as a programming language
From MaRDI portal
Publication:1243117
DOI10.1016/0304-3975(77)90044-5zbMath0369.68006DBLPjournals/tcs/Plotkin77OpenAlexW2007270285WikidataQ29395195 ScholiaQ29395195MaRDI QIDQ1243117
Publication date: 1978
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(77)90044-5
Related Items (only showing first 100 items - show all)
Characteristic bisimulation for higher-order session processes ⋮ 1998 European Summer Meeting of the Association for Symbolic Logic ⋮ Taylor expansion, finiteness and strategies ⋮ Quantitative logics for equivalence of effectful programs ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ Continuous probability distributions in concurrent games ⋮ On Applicative Similarity, Sequentiality, and Full Abstraction ⋮ Semantics of a sequential language for exact real-number computation ⋮ The Scott model of PCF in univalent type theory ⋮ Probabilistic operational semantics for the lambda calculus ⋮ Interdefinability of parallel operations in PCF ⋮ Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ A domain equation for bisimulation ⋮ Fully abstract translations between functional languages ⋮ A universality theorem for PCF with recursive types, parallel-or and ∃ ⋮ A two-level logic approach to reasoning about computations ⋮ Game semantics approach to higher-order complexity ⋮ Constructive natural deduction and its ‘ω-set’ interpretation ⋮ Game theoretic analysis of call-by-value computation ⋮ Games and full completeness for multiplicative linear logic ⋮ Projecting sequential algorithms on strongly stable functions ⋮ Size-based termination of higher-order rewriting ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ Stable bistructure models of PCF ⋮ Full abstraction for the second order subset of an ALGOL-like language ⋮ N. G. de Bruijn (1918--2012) and his road to Automath, the earliest proof checker ⋮ Categorical semantics of a simple differential programming language ⋮ A Denotational Semantics for Total Correctness of Sequential Exact Real Programs ⋮ On naturally continuous non-dcpo domains ⋮ Latent semantic analysis of game models using LSTM ⋮ Interpreting Localized Computational Effects Using Operators of Higher Type ⋮ Normal forms, linearity, and prime algebraicity over nonflat domains ⋮ Continuity in Semantic Theories of Programming ⋮ Simply typed fixpoint calculus and collapsible pushdown automata ⋮ Block structure vs scope extrusion: between innocence and omniscience ⋮ Unnamed Item ⋮ Sequential real number computation and recursive relations ⋮ An abstract data type for real numbers ⋮ Game-theoretic analysis of call-by-value computation ⋮ Note on Algol and conservatively extending functional programming ⋮ Intuitionistic fixed point logic ⋮ Observed Communication Semantics for Classical Processes ⋮ Metric Reasoning About $$\lambda $$-Terms: The General Case ⋮ $$\mathsf {qPCF}$$ : A Language for Quantum Circuit Computations ⋮ Unnamed Item ⋮ A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic ⋮ Higher-order processes and their models ⋮ A Type Theory for Probabilistic $$\lambda $$–calculus ⋮ Reference counting as a computational interpretation of linear logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Games and Definability For FPC ⋮ Krivine Machines and Higher-Order Schemes ⋮ Full abstraction for polymorphic \(\pi \)-calculus ⋮ Domains for Computation in Mathematics, Physics and Exact Real Arithmetic ⋮ A typed, algebraic, computational lambda-calculus ⋮ Sequential Real Number Computation and Recursive Relations ⋮ First-Order Universality for Real Programs ⋮ Recursive Functions with Pattern Matching in Interaction Nets ⋮ Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion ⋮ European Summer Meeting of the Association for Symbolic Logic, Hull, 1986 ⋮ A stable programming language ⋮ Introduction to Type Theory ⋮ Dependent Types at Work ⋮ A Relational Model of a Parallel and Non-deterministic λ-Calculus ⋮ Semantical proofs of correctness for programs performing non-deterministic tests on real numbers ⋮ A relational account of call-by-value sequentiality ⋮ Unnamed Item ⋮ On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T ⋮ Some Programming Languages Suggested by Game Models (Extended Abstract) ⋮ Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting ⋮ Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Fully Abstract Semantics for Constructor Systems ⋮ A Process-Model for Linear Programs ⋮ The Dedekind reals in abstract Stone duality ⋮ Unnamed Item ⋮ Effective λ-models versus recursively enumerable λ-theories ⋮ Full Abstraction at Package Boundaries of Object-Oriented Languages ⋮ Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages ⋮ On abstraction and the expressive power of programming languages ⋮ Dynamic game semantics ⋮ A game-semantic model of computation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine ⋮ On a monadic semantics for freshness ⋮ QPCF: higher-order languages and quantum circuits ⋮ Sequential algorithms and strongly stable functions ⋮ An abstract data type for real numbers ⋮ Observational program calculi and the correctness of translations ⋮ Logical Relations and Nondeterminism ⋮ Aspects of Categorical Recursion Theory ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types ⋮ Definability and Full Abstraction ⋮ Program equivalence in linear contexts
Uses Software
Cites Work
This page was built for publication: LCF considered as a programming language
