Derivation and inference of higher-order strictness types

DOI10.1016/j.cl.2015.07.004zbMath1387.68064OpenAlexW1880809740MaRDI QIDQ1749138

Sjaak Smetsers, Marko van Eekelen

Publication date: 15 May 2018

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/149047

zbMATH Keywords

operational semanticslambda calculusautomated theorem provingtypingstrictness analysis

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Uses Software

• GHC
• PoplMark

Cites Work

• Making ``stricterness more relevant
• Reviewing the Classical and the de Bruijn Notation for  -calculus and Pure Type Systems
• Polynomial Size Analysis of First-Order Shapely Functions
• Theorem Proving in Higher Order Logics
• A Machine-Oriented Logic Based on the Resolution Principle
• Strictness, totality, and non-standard-type inference
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Derivation and inference of higher-order strictness types