scientific article; zbMATH DE number 6790146

DOI10.23638/LMCS-13(3:9)2017zbMath1459.03015arXiv1611.05672MaRDI QIDQ5367047

Jakob Rehof, Andrej Dudenhefner, Moritz Martens

Publication date: 12 October 2017

Full work available at URL: https://arxiv.org/abs/1611.05672

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitytilingunificationequational theoryintersection type

Mathematics Subject Classification ID

Applications of game theory (91A80) Functional programming and lambda calculus (68N18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Equational classes, universal algebra in model theory (03C05) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Type inference for rank-2 intersection types using set unification ⋮ Unnamed Item

This page was built for publication: