John Harrison  Home/Search
Context Related
| cl.cam.ac.uk/users/j...manual1.1.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cl.cam.ac.uk/users/jrh/ho...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ion is in a precise sense a converse operation to application. Given 49 50 CHAPTER 5. PRIMITIVE BASIS OF HOL LIGHT a variable x and a term t, which may or may not contain x, one can construct the so-called lambda-abstraction x: t, which means `the function of x that yields t'. (In HOL's ASCII concrete syntax the backslash is used, e.g. \x. t.) For example, x: x + 1 is the function that adds one to its argument. Abstractions are not often seen in informal mathematics, but they have at least... (Update)
Context of citations to this paper: More
...system [14] from a US company called SRI International. Other contemporary systems of this kind are ACL2 [9] and Nuprl [3] from the US, HOL [5, 8] and Isabelle [15, 2 Freek Wiedijk and Jan Zwanenburg 16] from the UK and Germany, and the Coq system [1] from France. This last...
...a programming experiment with the HOL system. To be able to read this paper one has to have some familiarity with both the HOL [10] and Mizar [12, 17] systems. The software described here is not meant to be used for serious work (and it certainly doesn t emulate the full...
Cited by: More
Encoding the HOL Light logic in Coq - Wiedijk (Correct)
Integrating Gandalf and HOL - Hurd (1999) (Correct)
Mizar Light for HOL Light - Wiedijk (2001) (Correct)
Similar documents (at the sentence level):
67.8%: The HOL Light manual (1.0) - Harrison (1998) (Correct)
Active bibliography (related documents): More All
0.3: Some Lambda Calculus and Type Theory Formalized - McKinna, Pollack (1998) (Correct)
0.2: Theorem Proving with the Real Numbers - Harrison (1996) (Correct)
0.1: Finding Proofs and Checking Proofs - Harrison (1996) (Correct)
Similar documents based on text: More All
0.8: HOL Light: A tutorial introduction - Harrison (1996) (Correct)
0.7: The PROSPER Toolkit - Dennis, Collins, Boulton, Robinson.. (2001) (Correct)
0.4: A Thread of HOL Development - Norrish, Slind (2002) (Correct)
Related documents from co-citation: More All
3: Introduction to HOL (context) - Gordon, Melham - 1993
2: Fondation Philippe le Hodey (context) - Bonarska, to - 1990
2: PVS: A Prototype Verication System (context) - Owre, Rushby et al. - 1992
BibTeX entry: (Update)
John Harrison. The HOL Light manual (1.1), 2000. URL:
@misc{ harrison00hol,
author = "J. Harrison",
title = "The HOL Light manual",
text = "John Harrison. The HOL Light manual (1.1), 2000. URL: .",
year = "2000",
url = "citeseer.ist.psu.edu/article/harrison00hol.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978
362 ML for the Working Programmer (context) - Paulson - 1991
359 Introduction to higher order categorical logic (context) - Lambek, Scott - 1986
157 Edinburgh LCF: A Mechanised Logic of Computation (context) - Gordon, Milner et al. - 1979
144 Garbage collection: algorithms for automatic dynamic memory .. (context) - Jones, Lins - 1996
128 Logic and computation: interactive proof with Cambridge LCF (context) - Paulson - 1987
97 A Prolog Technology Theorem Prover: Implementation by an ext.. - Stickel - 1988
74 Mechanical theorem-proving by model elimination (context) - Loveland - 1968
46 A higher-order implementation of rewriting - Paulson - 1983
42 An overview of the MIZAR project (context) - Rudnicki - 1992
39 Le langage Caml (context) - Weis, Leroy - 1993
38 Deciding ML typability is complete for deterministic exponen.. (context) - Mairson - 1990
34 The American Mathematical Monthly (context) - Lagarias, The - 1985
29 A lattice-theoretical xpoint theorem and its applications (context) - Tarski - 1955
27 Principia Mathematica (context) - Whitehead, Russell - 1910
13 A theory of propositional types (context) - Henkin - 1963
8 Functional programming using CAML Light - Mauny - 1995
8 Ordered rewriting and con uence (context) - Martin, Nipkow - 1990
6 Semantics and Metamathematics (context) - Tarski - 1956
3 Natural deduction; a proof-theoretical study (context) - Prawitz - 1965
2 The structure of programming languages (context) - Raphael - 1966
2 The Art of Computer Programming; Volume 2: Seminumerical Alg.. (context) - Knuth - 1969
1 Unication of simply typed lamda-terms as logic programming (context) - Miller - 1991
Documents on the same site (http://www.cl.cam.ac.uk/users/jrh/hol-light/index.html):
The HOL Light manual (1.0) - Harrison (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC