Refined typing to localize the impact of forced strictness on free theorems

DOI10.1007/s00236-011-0136-9zbMath1237.68051OpenAlexW1975913387MaRDI QIDQ766167

Janis Voigtländer, Daniel Seidel

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-011-0136-9

zbMATH Keywords

type systemparametrically polymorphic functions

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Making ``stricterness more relevant

Uses Software

• CLEAN
• Haskell

Cites Work

• Making ``stricterness more relevant
• Free theorems involving type constructor classes
• Shortcut fusion for accumulating parameters & zip-like functions
• Much ado about two (pearl)
• Testing Polymorphic Properties
• Automatically Generating Counterexamples to Naive Free Theorems
• Contraction-free sequent calculi for intuitionistic logic
• Short cut fusion is correct
• On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi
• Combining syntactic and semantic bidirectionalization
• Semantics and Pragmatics of New Shortcut Fusion Rules
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Refined typing to localize the impact of forced strictness on free theorems