scientific article
From MaRDI portal
Publication:2704328
zbMath0967.68035MaRDI QIDQ2704328
Publication date: 19 March 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (38)
A theory of bisimulation for a fragment of concurrent ML with local names ⋮ An approach to deciding the observational equivalence of Algol-like languages ⋮ A Nominal Relational Model for Local Store ⋮ New ⋮ A Complete, Co-inductive Syntactic Theory of Sequential Control and State ⋮ Algorithmic games for full ground references ⋮ Call-by-push-value: Decomposing call-by-value and call-by-name ⋮ An observationally complete program logic for imperative higher-order functions ⋮ Full abstraction for Reduced ML ⋮ A bisimulation-like proof method for contextual properties in untyped \(\lambda \)-calculus with references and deallocation ⋮ Semantic preservation for a type directed translation scheme of Featherweight Go ⋮ Program equivalence in an untyped, call-by-value functional language with uncurried functions ⋮ A relational realizability model for higher-order stateful ADTs ⋮ Program equivalence in a simple language with state ⋮ ML and Extended Branching VASS ⋮ A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators ⋮ Local variable scoping and Kleene algebra with tests ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ Algorithmic Nominal Game Semantics ⋮ Complete trace models of state and control ⋮ Proving correctness of a compiler using step-indexed logical relations ⋮ A Fragment of ML Decidable by Visibly Pushdown Automata ⋮ On generic context lemmas for higher-order calculi with sharing ⋮ Proof-Relevant Logical Relations for Name Generation ⋮ Hard Life with Weak Binders ⋮ Capsules and Closures ⋮ From Applicative to Environmental Bisimulation ⋮ Functions with local state: regularity and undecidability ⋮ Typing termination in a higher-order concurrent imperative language ⋮ Full Abstraction for Reduced ML ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References ⋮ The lambda-context calculus (extended version) ⋮ On a monadic semantics for freshness ⋮ Unnamed Item ⋮ Genericity and the \(\pi\)-calculus ⋮ Gradual type theory
Uses Software
This page was built for publication:
