|
|
DSpace at RU >
Browsing by Faculty / Department Foundations
Showing results 1 to 20 of 173
| Full Text | Issue Date | Title | Author(s) | | 1979 | The matrix of a connection having regular singularities on a vector bundle of rank 2 on IP1(c) | Dekkers, W. |
| 1987 | Towards an intermediate language based on Graph Rewriting | Barendregt, H.P.; Eekelen, M.C.J.D. van; Glauert, J.R.W.; Kennaway, J.R.; Plasmeijer, M.J., et al |
| 1988 | Reducibility of types in typed lambda calculus: Comment on a paper by Richard Statman | Dekkers, W. |
| 1991 | Modular Proof of Strong Normalization for the Calculus of Constructions | Geuvers, J.H.; Nederhof, MJ |
| 1992 | The Church-Rosser property for βη-reduction in typed λ-calculi | Geuvers, J.H. |
| 1992 | Inductive and Coinductive Types with Iteration and Recursion | Geuvers, J.H. |
| 1994 | Modularity of strong normalization and confluence in the algebraic-λ-cube | Barbanera, F.; Fernandez, M.; Geuvers, J.H. |
| 1994 | Untyped lambda-calculus, Typed lambda-calculus, sections 32 and 33 | Geuvers, J.H.; Nederpelt, R.P. |
| 1994 | Guaranteeing safe destructive updates through a type system with uniqueness information for graphs | Smetsers, S.; Barendsen, E.; Eekelen, M.C.J.D. van; Plasmeijer, R. |
| 1994 | Conservativity between logics and typed λ calculi | Geuvers, J.H. |
| 1995 | The Calculus of Constructions and Higher Order Logic | Geuvers, J.H. |
| 1998 | Illative Combinatory Logic | Dekkers, W. |
| 1999 | Safe proof checking in type theory with Y | Geuvers, J.H.; Poll, E.; Zwanenburg, J. |
| 2000 | Equational reasoning via partial reflection | Geuvers, J.H.; Wiedijk, F.; Zwanenburg, J. |
| 2001 | Pure type systems with more liberal rules | Bunder, M.; Dekkers, W. |
| 2001 | Induction is not derivable in second order dependent type theory | Geuvers, J.H. |
| 2001 | Certified and Portable Mathematical Documents from Formal Contexts | Caprotti, O.; Geuvers, J.H.; Oostdijk, M.D. |
| 2002 | Proof by Computation in the Coq system | Oostdijk, M.D.; Geuvers, J.H. |
| 2002 | A constructive algebraic hierarchy in Coq | Geuvers, J.H.; Pollack, R.; Wiedijk, F.; Zwanenburg, J. |
| 2002 | Open proofs and open terms: A basis for interactive logic | Geuvers, J.H.; Jojgov, G.I. |
Showing results 1 to 20 of 173
|