Programming Languages and Systems

DOI10.1007/11693024zbMath1178.68146OpenAlexW2491912653MaRDI QIDQ5899009

Amal Ahmed

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11693024

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

On the Versatility of Open Logical Relations, A Kripke logical relation for effect-based program transformations, A Complete, Co-inductive Syntactic Theory of Sequential Control and State, Translation certification for smart contracts, Differential logical relations. II: Increments and derivatives, A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go, Semantic preservation for a type directed translation scheme of Featherweight Go, Polarized subtyping, Program equivalence in an untyped, call-by-value functional language with uncurried functions, A relational realizability model for higher-order stateful ADTs, Temporal refinements for guarded recursive types, Selective strictness and parametricity in structural operational semantics, inequationally, Proving correctness of a compiler using step-indexed logical relations, A verified framework for higher-order uncurrying optimizations, Typing termination in a higher-order concurrent imperative language, Transfinite Step-Indexing: Decoupling Concrete and Logical Steps, A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs, A family of syntactic logical relations for the semantics of Haskell-like languages, Unnamed Item, A case study in programming coinductive proofs: Howe’s method, Unnamed Item, Observational program calculi and the correctness of translations, Syntactic Logical Relations for Polymorphic and Recursive Types, Free Theorems and Runtime Type Representations, Gradual type theory, Relational cost analysis in a functional-imperative setting, Taming the Merge Operator