| LF+ in Coq for "fast and loose" reasoning | 0 | 0.34 | 2019 |
| A Definitional Implementation of the Lax Logical Framework LLFP in Coq, for Supporting Fast and Loose Reasoning. | 0 | 0.34 | 2019 |
| Tiered Objects. | 0 | 0.34 | 2016 |
| An irregular filter model | 0 | 0.34 | 2008 |
| Recursive domain equations of filter models | 1 | 0.38 | 2008 |
| Intersection types and lambda models | 8 | 0.61 | 2006 |
| Type Preorders and Recursive Terms | 0 | 0.34 | 2005 |
| Intersection types and domain operators | 6 | 0.48 | 2004 |
| A category of compositional domain-models for separable stone spaces | 4 | 0.45 | 2003 |
| Tailoring Filter Models | 1 | 0.37 | 2003 |
| Intersection Types and Computational Rules | 12 | 0.65 | 2003 |
| Filter Models and Easy Terms | 14 | 0.80 | 2001 |
| A Complete Characterization of the Complete Intersection-Type Theories | 7 | 0.58 | 2000 |
| A characterization of distance between 1-bounded compact ultrametric spaces through a universal space | 0 | 0.34 | 1998 |
| Partializing Stone Spaces using SFP Domains (Extended Abstract) | 2 | 0.42 | 1997 |
| A convex powerdomain over lattices: its logic and &lgr;-calculus | 0 | 0.34 | 1997 |
| Solutions of functorial and non-functorial metric domain equations | 6 | 1.60 | 1995 |
| A fixed-point theorem in a category of compact metric spaces | 5 | 0.82 | 1995 |
| May and Must Convergencey in Concurrent Lambda-Calculus | 0 | 0.34 | 1994 |
| Type Preorders | 5 | 0.51 | 1994 |
| Strong Conjunction And Intersection Types | 12 | 1.66 | 1991 |
