Making ``stricterness'' more relevant
type: Item
instance of: scholarly article
title: Making ``stricterness'' more relevant
zbMATH Open document ID: 1232.68026
author: Stefan Holdermans
author: Jurriaan Hage
published in: Higher-Order and Symbolic Computation
publication date: 2012-01-13T00:00:00Z
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 5997566
zbMATH Keywords: lazy evaluation
zbMATH Keywords: strictness analysis
zbMATH Keywords: relevance typing
zbMATH Keywords: explicit strictness annotations
zbMATH Keywords: functional languages
zbMATH Keywords: type and effect systems
describes a project that uses: CLEAN
describes a project that uses: Haskell
MaRDI profile type: Publication
full work available at URL: s10990-011-9079-7
OpenAlex ID: W1967925712
cites work: Q4085699
cites work: Q4297115
cites work: Needed reduction and spine strategies for the lambda calculus
cites work: Q2757801
cites work: Q3729991
cites work: A linear logical framework
cites work: Strictness, totality, and non-standard-type inference
cites work: Proof Tool Support for Explicit Strictness
cites work: Q4778697
cites work: A generic usage analysis with subeffect qualifiers
cites work: Q3130262
cites work: Q5472909
cites work: Q3774923
cites work: Q3875320
cites work: Q4414308
cites work: Safety of Nöcker's strictness analysis
cites work: Refined typing to localize the impact of forced strictness on free theorems
cites work: Strictness and totality analysis
cites work: Polymorphic type, region and effect inference
DOI: 10.1007/S10990-011-9079-7
description: scientific article; zbMATH DE number 5997566