Most importantly, he showed that equi-recursive types are not conservative over full 𝐹≤. In other words, adding equi-recursive types to full 𝐹≤ changes the expressive power of the subtyping relation, even when the types being compared do not involve any recursive types.
Nov 7, 2022
With non-conservativity, satisfaction of these equations could be not sufficient to ensure even the coherence of the interpretation of mF≤ judgements not.
Jun 28, 2005 · F≤ does not include a notion of recursive types, but extensions of F≤ with recursive types are widely used as a basis for foundational studies ...
With non-conservativity, satisfaction of these equations could be not sufficient to ensure even the coherence of the interpretation of txF< judgements not.
Contractive signatures with recursive types, type parameters, and abstract types. ICALP'13: Proceedings of the 40th international conference on Automata, ...
In this paper we show that adding recursive types results in a non conservative extension of the system. ... However, we prove that this non conservativity is ...
Aug 4, 2009 · I was chatting with Sadek Drobi on twitter when be brought up that F# didn't seem to support Infinite Types. It turns out that in C# you can do something along ...
Missing: Conservative | Show results with:Conservative
Oct 8, 2024 · This paper proposes a generalization of iso-recursive types called full iso-recursive types. Full iso-recursive types allow encoding all programs with equi- ...
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log ...
Oct 21, 2019 · Also, note that the relation between polymorphic LC (or: System F) and simply typed LC is rather tenuous. The former is not merely the latter ...
Missing: Conservative | Show results with:Conservative