61 citations · 90 across the 12 of their papers we have counts for
4 papers · 1 filter
Fixed point combinators as fixed points of higher-order fixed point generators
Andrew Polonsky
Corrado Böhm once observed that if is any fixed point combinator (fpc), then is again fpc. He thus discovered the first "fpc generating scheme" -- a generic way…
On sets of terms having a given intersection type
Andrew Polonsky, Richard Statman
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersect…
On local presentability of T/A
Patricia Johann, Andrew Polonsky
We prove that if is a locally -presentable category and is a -accessible functor then is locally -presentab…
Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture
Benedetto Intrigila, Giulio Manzonetto, Andrew Polonsky
The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between Böhm trees. It is well known that the lambda-t…