LCF considered as a programming language
From MaRDI portal
Publication:1243117
DOI10.1016/0304-3975(77)90044-5zbMath0369.68006WikidataQ29395195 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
68N01: General topics in the theory of software
Related Items
Fully abstract translations between functional languages, A universality theorem for PCF with recursive types, parallel-or and ∃, Games and full completeness for multiplicative linear logic, Unnamed Item, Unnamed Item, Games and Definability For FPC, Domains for Computation in Mathematics, Physics and Exact Real Arithmetic, Note on Algol and conservatively extending functional programming, Reference counting as a computational interpretation of linear logic, Constructive set theoretic models of typed combinatory logic, Denotational aspects of untyped normalization by evaluation, On the ubiquity of certain total type structures, From Logic to Theoretical Computer Science – An Update, On Natural Non-dcpo Domains, Computing with Functionals—Computability Theory or Computer Science?, Strictness, totality, and non-standard-type inference, Two applications of analytic functors, On the construction of stable models of untyped \(\lambda\)-calculus, A typed context calculus, Finitary PCF is not decidable, On the expressive power of first-order boolean functions in PCF, Constructive natural deduction and its ‘ω-set’ interpretation, 1998 European Summer Meeting of the Association for Symbolic Logic, A fully abstract may testing semantics for concurrent objects, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Fully abstract compositional semantics for an algebra of logic programs, A uniform treatment of order of evaluation and aggregate update, On stable domains, Subrecursive hierarchies on Scott domains, Partial inductive definitions as type-systems for \(\lambda\)-terms, The semantics of second-order lambda calculus, Functorial polymorphism, Semantics of algorithmic languages, Distributive semantics for nondeterministic typed \(\lambda\)-calculi, Expressive power of typed and type-free programming languages, Call-by-push-value: Decomposing call-by-value and call-by-name, On the relations between monadic semantics, Domain interpretations of Martin-Löf's partial type theory, A domain model characterising strong normalisation, A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction, Structured algebraic specifications: A kernel language, A theory for nondeterminism, parallelism, communication, and concurrency, Toward formal development of programs from algebraic specifications: Implementations revisited, Full abstraction and limiting completeness in equational languages, \(\mathbb{T}^\omega\) as a universal domain, A mathematical semantics for a nondeterministic typed lambda-calculus, The IO- and OI-hierarchies, Sequential algorithms on concrete data structures, Domain theory in logical form, Correctness of concurrent processes, About primitive recursive algorithms, Relation algebraic domain constructions, On the expressive power of finitely typed and universally polymorphic recursive procedures, Semantics for data parallel computation, New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic, Characterizing complexity classes by higher type primitive recursive definitions, Towards a theory of parallel algorithms on concrete data structures, Confluence of the lambda calculus with left-linear algebraic rewriting, An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus, Total sets and objects in domain theory, Completeness results for the equivalence of recursive schemas, Fully abstract models of typed \(\lambda\)-calculi, A syntactic theory of sequential state, Induction and recursion on the partial real line with applications to Real PCF, System \(T\), call-by-value and the minimum problem, Unary PCF is decidable, Decidability of behavioural equivalence in unary PCF, Properly injective spaces and function spaces, \({\mathcal M}^\omega\) considered as a programming language, Nonexpressibility of fairness and signaling, Computational foundations of basic recursive function theory, General recursive functions in a very simply interpretable typed \(\lambda\)-calculus, Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin, Combinatory reduction systems: Introduction and survey, A type-theoretical alternative to ISWIM, CUCH, OWHY, Computational adequacy of the FIX-logic, PCF extended with real numbers, Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals, Full abstraction for the second order subset of an Algol-like language, On the Jacopini technique, A general adequacy result for a linear functional language, Degrees of parallelism in the continuous type hierarchy, Term rewriting for normalization by evaluation., From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Relative definability of boolean functions via hypergraphs, Exact real number computations relative to hereditarily total functionals., A unary representation result for system \(T\), Describing semantic domains with sprouts, Two-level languages for program optimization, On the semantics of polymorphism, The sequentially realizable functionals, A relative PCF-definability result for strongly stable functions and some corollaries, Relational interpretations of recursive types in an operational setting., Games and full abstraction for FPC., Integration in Real PCF, Full abstraction for PCF, Encoding linear logic with interaction combinators, On inner classes, Ordered SOS process languages for branching and eager bisimulations, Infinitary lambda calculus and discrimination of Berarducci trees., The origins of structural operational semantics, An approach to deciding the observational equivalence of Algol-like languages, Computational adequacy for recursive types in models of intuitionistic set theory, Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms, Projecting sequential algorithms on strongly stable functions, An abstract data type for real numbers, Game-theoretic analysis of call-by-value computation, Semantics of a sequential language for exact real-number computation, Full abstraction for polymorphic \(\pi \)-calculus, A stable programming language, A relational account of call-by-value sequentiality, On a monadic semantics for freshness, Sequential algorithms and strongly stable functions, Interdefinability of parallel operations in PCF, Recursive programs and denotational semantics in absolute logics of programs, A domain equation for bisimulation, European Summer Meeting of the Association for Symbolic Logic, Hull, 1986, A Denotational Semantics for Total Correctness of Sequential Exact Real Programs, Interpreting Localized Computational Effects Using Operators of Higher Type, Sequential real number computation and recursive relations, A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic, A Relational Model of a Parallel and Non-deterministic λ-Calculus, Unnamed Item
Uses Software
Cites Work
