Effect system for BoCa: a Prolog Implementation (2008)
at w(P) #=#, where the weight function w is defined as follows: w( ) = 1 w(0 0 0) = 0 w(P Q) = w(P)+w(Q) w((n n na : W )P) = w(P) w(M.P) = w(P) w(a [ [ [ P ] ] ]) = if w(P) = k then k else w(k# P) =...
The Minimal Relevant Logic and the Call-by-Value Lambda Calculus (1999)
S. Van Bakel, M. Dezani-ciancaglini, U. De'Liguoro, Y. Motohama
The minimal relevant logic B+, seen as a type discipline, includes an extension of Curry types known as the intersection type discipline. We will show that the full logic B+ gives a type assignment...
Must Preorder in Non-Deterministic Untyped λ-calculus (1992)
This paper studies the interplay between functional application and nondeterministic choice in the context of untyped -calculus. We introduce an operational semantics which is based on the idea of...