scientific article; zbMATH DE number 2090728
From MaRDI portal
Publication:4813228
zbMath1065.68067MaRDI QIDQ4813228
Publication date: 13 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2395/23950378.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (17)
An approach to deciding the observational equivalence of Algol-like languages ⋮ Encoding abstract syntax without fresh names ⋮ Executing and verifying higher-order functional-imperative programs in Maude ⋮ Operationally-based program equivalence proofs using LCTRSs ⋮ Latent semantic analysis of game models using LSTM ⋮ Program equivalence in an untyped, call-by-value functional language with uncurried functions ⋮ Unnamed Item ⋮ Modular Verification of Procedure Equivalence in the Presence of Memory Allocation ⋮ Program equivalence by circular reasoning ⋮ A language-independent proof system for full program equivalence ⋮ Closures of may-, should- and must-convergences for contextual equivalence ⋮ Exception tracking in an open world ⋮ Operational domain theory and topology of sequential programming languages ⋮ On a monadic semantics for freshness ⋮ Unnamed Item ⋮ Rule-Based Operational Semantics for an Imperative Language ⋮ Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
This page was built for publication:
