Information technology implications . . .

Information technology implications . . .

Cached

Download Links

[math.unice.fr]

by Marco Maggesi , Carlos Simpson

BibTeX

@MISC{Maggesi_informationtechnology,
    author = {Marco Maggesi and Carlos Simpson},
    title = {Information technology implications . . . },
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

874	A theory of type polymorphism in programming - Milner - 1978
221	Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972
113	Solution to the Robbins problem - McCune - 1997
106	The type-theoretic interpretation of constructive set theory: inductive definitions - Aczel - 1986
75	Ecc: an extended calculus of constructions - Luo - 1989
59	A per model of polymorphism and recursive types - Abadi, Plotkin
58	An analysis of Girard’s paradox - Coquand - 1985
49	Introduction to generalized type systems - Barendregt - 1991
44	Structured Theory Development for a Mechanized Logic - Kaufmann, Moore
43	Should Your Specification Language Be Typed - Paulson - 1999
39	Proof assistants using dependent type systems - Barendregt, Geuvers - 2001
38	Using reflection to build efficient and certified decision procedures - Boutin - 1281
35	Benthem Jutting. Checking Landau’s “Grundlagen” in the AUTOMATH system - van - 1977
28	A non-type-theoretic definition of Martin-Löf’s types - Allen
27	Importing mathematics from HOL into Nuprl - Howe - 1996
23	Finite functions and the necessary use of large cardinals - Friedman - 1998
23	Formalized metareasoning in type theory - Knoblock, Constable
22	A constructive proof of the fundamental theorem of algebra without using the rationals - Geuvers, Wiedijk, et al.
21	About models for intuitionistic type theories and the notion of definitional equality - Martin-Löf - 1973
17	Sphere packings - Hales - 1997
13	Experiments with ZF Set Theory in HOL and Isabelle - Agerholm, Gordon - 1995
13	The HOL-Light manual - Harrison - 2000
13	The computational behaviour of Girard’s paradox - Howe
11	STMM: a Set Theory for Mechanized Mathematics - Farmer
11	Two models of synthetic domain theory - Fiore, Rosolini - 1997
11	Merging HOL with Set Theory: preliminary experiments - Gordon - 1994
11	A Precise Description of the ACL2 Logic - Kaufmann, Moore - 1997
10	A survey of automated deduction - Bundy - 1999
8	Two computersupported proofs in metric space topology - Farmer, Thayer - 1991
8	The Flyspeck Project Fact Sheet. http://www.math.pitt.edu/~thales/flyspeck/index.html - Hales
7	A skeptic’s approach to combining HOL - Harrison, Théry - 1998
6	An axiomatisation of intuitionistic Zermelo-Fraenkel set theory. See http://coq.inria.fr/contribs-eng.html - Alexandre
6	Sur la formalisation des mathématiques dans le Calcul des Constructions Inductives. Thesis, Université de Nice-Sophia Antipolis - Chicli - 2003
6	A Combination of Geometry Theorem Proving and Nonstandard Analysis, with Application to Newton’s Principia - Fleuriot - 2001
6	Inconsistency of classical logic in type theory. http://www.cs.kun.nl/~herman/note.ps.gz See also other publications athttp://www.cs.kun.nl/~herman/pubs.html 35 - Geuvers
6	Computer Math Proof Shows Reasoning Power, The - Kolata - 1996
5	Evelyne Contejean, and Hervé Devie, A new AC unification algorithm with an algorithm for solving systems of diophantine equations - Boudet
5	A prototype proof translator from HOL to Coq - Denney - 2000
5	Proof reflection in Coq - Hendriks
5	Types considered harmful, or Types are not harmless. This appeared under the first title in a posting by P. Rudnicki on [68], Volume 2 - Lamport - 1994
4	Mathematical quotients and quotient types - Chicli, Pottier, et al.
4	Encoding the calculus of constructions in a higher-order logic - Felty - 1993
4	LCF to HOL: a short history, Proof, language, and interaction, Found. Comput - Gordon, From - 2000
4	A computer verification of the Kepler conjecture - Hales - 2002
4	A program from an A-translated impredicative proof of Higman’s Lemma - Herbelin
4	A formal proof of Sylow’s theorem. An experiment in abstract algebra with Isabelle HOL - Kammüller, Paulson - 1999
4	The notion of a Framework and a framework for LTC - Mendler, Aczel
3	Gérard Huet, Constructions: a higher order proof system for mechanizing mathematics - Coquand - 1985
3	A comparison of PVS and Isabelle/HOL, Theorem Proving - Griffioen, Huisman - 1998
3	Fta : Fundamental theorem of algebra project - Geuvers, Herman, et al. - 2000