Type fixpoints
From MaRDI portal
Publication:2817715
DOI10.1145/317636.317789zbMath1343.03010MaRDI QIDQ2817715
Paweł Urzyczyn, Zdzisław Spławski
Publication date: 1 September 2016
Published in: Proceedings of the fourth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/317636.317789
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
03B40: Combinatory logic and lambda calculus
Related Items
Termination checking with types, A Tutorial on Type-Based Termination, Least and greatest fixed points in intuitionistic natural deduction, Non-strictly positive fixed points for classical natural deduction, Minimality in a Linear Calculus with Iteration, Parametricity, type equality, and higher-order polymorphism, Two extensions of system F with (co)iteration and primitive (co)recursion principles