Publication:3204055
From MaRDI portal
zbMath0716.68065MaRDI QIDQ3204055
Publication date: 1989
68N15: Theory of programming languages
68Q60: Specification and verification (program logics, model checking, etc.)
03F35: Second- and higher-order arithmetic and fragments
03B40: Combinatory logic and lambda calculus
Related Items
From rewrite rules to bisimulation congruences, Proving the correctness of recursion-based automatic program transformations, Innovations in computational type theory using Nuprl, On generic context lemmas for higher-order calculi with sharing, Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi, Process calculus based upon evaluation to committed form, A co-induction principle for recursively defined domains, On reduction-based process semantics, A fully abstract denotational semantics for the \(\pi\)-calculus, A theory of bisimulation for a fragment of concurrent ML with local names, A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
Uses Software