Practical Subtyping for Curry-Style Languages. | 0 | 0.34 | 2019 |
Subtyping-Based Type-Checking for System F with Induction and Coinduction. | 0 | 0.34 | 2016 |
MathAbs: a representational language for mathematics | 4 | 0.46 | 2010 |
Some properties of random lambda terms | 8 | 0.60 | 2009 |
Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work) | 2 | 0.52 | 2008 |
PhoX | 0 | 0.34 | 2006 |
System ST \beta-reduction and completeness | 1 | 0.38 | 2003 |
System ST toward a type system for extraction and proofs of programs | 1 | 0.38 | 2003 |
Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic | 2 | 0.44 | 2003 |
Completeness, minimal logic and programs extraction | 0 | 0.34 | 2001 |
A semantical storage operator theorem for all types | 1 | 0.39 | 1998 |
Machine deduction | 4 | 0.49 | 1993 |
Data Types, Infinity and Equality in System AF2 | 6 | 0.54 | 1993 |