A family of syntactic logical relations for the semantics of Haskell-like languages

DOI10.1016/J.IC.2007.11.009MaRDI QIDQ1012131zbMATH OpenOpenAlexFDO

Authors Patricia Johann, Janis Voigtländer

Publication date 14 April 2009

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL http://libres.uncg.edu/ir/asu/f/Johann_Patricia_2009_A_Family_Of_Syntactic_logical.Haskell.semantics.Logical.pdf

zbMATH Keywords

GHC Corelanguages with parametric polymorphism

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)

Recommendations

• Syntactic logical relations for polymorphic and recursive types
• Selective strictness and parametricity in structural operational semantics, inequationally
• Publication:3476794
• Logical relations for monadic types
• scientific article; zbMATH DE number 1948186

Cites work

• scientific article; zbMATH DE number 51766 (Why is no real title available?)
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 3485758 (Why is no real title available?)
• scientific article; zbMATH DE number 1952947 (Why is no real title available?)
• scientific article; zbMATH DE number 1497772 (Why is no real title available?)
• scientific article; zbMATH DE number 5033863 (Why is no real title available?)
• scientific article; zbMATH DE number 2238212 (Why is no real title available?)
• Concatenate, reverse and map vanish for free
• Free theorems in the presence of seq
• Fundamental concepts in programming languages
• Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
• Monadic augment and generalised short cut fusion
• Parametric polymorphism and operational equivalence
• Programming Languages and Systems
• Proof Tool Support for Explicit Strictness
• Selective strictness and parametricity in structural operational semantics, inequationally
• Short cut fusion is correct
• Shortcut fusion for accumulating parameters & zip-like functions
• Syntactic logical relations for polymorphic and recursive types
• Typer inference builds a short cut to deforestation

Cited in

(1)

• Parametricity for Haskell with Imprecise Error Semantics

Describes a project that uses

Uses Software

• Haskell

This page was built for publication: A family of syntactic logical relations for the semantics of Haskell-like languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1012131)