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

DOI10.1016/j.ic.2007.11.009zbMath1165.68024OpenAlexW2131167088MaRDI QIDQ1012131

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)

Related Items (1)

Parametricity for Haskell with Imprecise Error Semantics

Uses Software

• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental concepts in programming languages
• Selective strictness and parametricity in structural operational semantics, inequationally
• Typer inference builds a short cut to deforestation
• Syntactic Logical Relations for Polymorphic and Recursive Types
• Concatenate, reverse and map vanish for free
• Shortcut fusion for accumulating parameters & zip-like functions
• Free theorems in the presence of seq
• Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
• Proof Tool Support for Explicit Strictness
• Short cut fusion is correct
• Parametric polymorphism and operational equivalence
• Monadic augment and generalised short cut fusion
• Programming Languages and Systems

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