Types, potency, and idempotency

DOI10.1145/1016850.1016871zbMath1323.68223OpenAlexW4233636389MaRDI QIDQ5178032

Peter Møller Neergaard, Harry G. Mairson

Publication date: 9 March 2015

Published in: Proceedings of the ninth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1016850.1016871

zbMATH Keywords

complexitynormalizationintersection typestype inferenceidempotenceproofnet

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (12)

Unnamed Item ⋮ A resource aware semantics for a focused intuitionistic calculus ⋮ Execution time of λ-terms via denotational semantics and intersection types ⋮ Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Structural rules and algebraic properties of intersection types ⋮ Tight typings and split bounds, fully developed ⋮ On strong normalization and type inference in the intersection type discipline ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reasoning About Call-by-need by Means of Types ⋮ Inhabitation of Low-Rank Intersection Types ⋮ Essential and relational models

This page was built for publication: Types, potency, and idempotency