Fundamental concepts in programming languages
From MaRDI portal
Cited in
(32)- Functorial polymorphism
- Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping
- A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
- Executable component-based semantics
- VDM semantics of programming languages: Combinators and monads
- POP, a broad-spectrum programming language, 1967--2002
- Formal parametric polymorphism
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages
- The transformation of requirements into software primitives: studying evolvability based on systems theoretic stability
- The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian
- A syntactic correspondence between context-sensitive calculi and abstract machines
- Relationship between definition and implementation of a language
- Universal properties for universal types in bifibrational parametricity
- Type polymorphism, natural language semantics, and TIL
- The Girard-Reynolds isomorphism (second edition)
- A family of syntactic logical relations for the semantics of Haskell-like languages
- Propositional dynamic logic for reasoning about first-class agent interaction protocols
- Intensional harmony as isomorphism
- Parametric Polymorphism — Universally
- Bifibrational functorial semantics of parametric polymorphism
- Comprehensive Parametric Polymorphism: Categorical Models and Type Theory
- Programming and symbolic computation in Maude
- The Girard-Reynolds isomorphism
- SLP: A paged processor for compact lists
- scientific article; zbMATH DE number 3221703 (Why is no real title available?)
- Generic top-down discrimination for sorting and partitioning in linear time
- Hoare logic for Java in Isabelle/HOL
- A theory of type polymorphism in programming
- Coercions in a polymorphic type system
- Proof-Relevant Parametricity
- Full abstraction and the Context Lemma (preliminary report)
- Polymorphism and the obstinate circularity of second order logic: a victims' tale
This page was built for publication: Fundamental concepts in programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1566861)
