Fundamental concepts in programming languages
From MaRDI portal
Publication:1566861
DOI10.1023/A:1010000313106zbMath0949.68510DBLPjournals/lisp/Strachey00OpenAlexW2127382014WikidataQ55878568 ScholiaQ55878568MaRDI QIDQ1566861
Publication date: 12 December 2000
Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1010000313106
Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)
Related Items (28)
Logical relations and parametricity -- a Reynolds programme for category theory and programming languages ⋮ The Girard-Reynolds isomorphism ⋮ Proof-Relevant Parametricity ⋮ Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping ⋮ A syntactic correspondence between context-sensitive calculi and abstract machines ⋮ The Girard-Reynolds isomorphism (second edition) ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ Parametric Polymorphism — Universally ⋮ PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS ⋮ Type polymorphism, natural language semantics, and TIL ⋮ Hoare logic for Java in Isabelle/HOL ⋮ Coercions in a polymorphic type system ⋮ Universal properties for universal types in bifibrational parametricity ⋮ Bifibrational functorial semantics of parametric polymorphism ⋮ Executable component-based semantics ⋮ POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE ⋮ Generic top-down discrimination for sorting and partitioning in linear time ⋮ VDM semantics of programming languages: Combinators and monads ⋮ The transformation of requirements into software primitives: studying evolvability based on systems theoretic stability ⋮ SLP: A paged processor for compact lists ⋮ A theory of type polymorphism in programming ⋮ Programming and symbolic computation in Maude ⋮ Comprehensive Parametric Polymorphism: Categorical Models and Type Theory ⋮ A family of syntactic logical relations for the semantics of Haskell-like languages ⋮ Functorial polymorphism ⋮ The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian ⋮ A functional correspondence between monadic evaluators and abstract machines for languages with computational effects ⋮ Formal parametric polymorphism
This page was built for publication: Fundamental concepts in programming languages
