scientific article; zbMATH DE number 1241702

zbMath0919.68086MaRDI QIDQ4225152

Andrew M. Pitts

Publication date: 18 January 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

functional languagesdenotational semanticstheory of domains

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items

ANF preserves dependent types up to extensional equality, Applicative Bisimulation and Quantum λ-Calculi, A two-valued logic for properties of strict functional programs allowing partial functions, Operational equivalence for interaction nets., Alpha equivalence equalities, Program equivalence in an untyped, call-by-value functional language with uncurried functions, Local variable scoping and Kleene algebra with tests, On the observational theory of the CPS-calculus, Capsules and Closures, Closures of may-, should- and must-convergences for contextual equivalence, Strictness, totality, and non-standard-type inference, Coinductive big-step operational semantics, Operational domain theory and topology of sequential programming languages, A case study in programming coinductive proofs: Howe’s method, Encoding FIX in Object Calculi, Relational interpretations of recursive types in an operational setting., Syntactic Logical Relations for Polymorphic and Recursive Types, Program equivalence in linear contexts