Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,286,837 papers from all fields of science
Search
Sign In
Create Free Account
Automath
Known as:
Automath theorem prover
Automath (automating mathematics) was a formal language, devised by Nicolaas Govert de Bruijn starting in 1967, for expressing complete mathematical…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Automated theorem proving
Coq (software)
Curry–Howard correspondence
Explicit substitution
Expand
Broader (1)
Type theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
F. Wiedijk
Journal of Applied Logic
2006
Corpus ID: 375809
2004
2004
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
B. Buchberger
Artificial Intelligence and Symbolic Computation
2004
Corpus ID: 17095553
We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the…
Expand
2003
2003
A New Implementation of Automath
F. Wiedijk
Journal of automated reasoning
2003
Corpus ID: 5549697
This paper presents aut, a modern Automath checker. It is a straightforward re-implementation of the Zandleven Automath checker…
Expand
1999
1999
On Pi-Conversion in the lambda-Cube and the Combination with Abbreviations
Fairouz Kamareddine
,
Roel Bloo
,
R. Nederpelt
Annals of Pure and Applied Logic
1999
Corpus ID: 10126513
Highly Cited
1998
Highly Cited
1998
Theorem proving with the real numbers
J. Harrison
CPHC/BCS distinguished dissertations
1998
Corpus ID: 38754316
The Distinguished Dissertation series is published on behalf of the Conference of Professors and Heads of Computing and the…
Expand
1994
1994
First-Order Automation for Higher-Order-Logic Theorem Proving
Holger Busch
International Conference on Theorem Proving in…
1994
Corpus ID: 21440487
In comparison with higher-order-logic proof checkers, automatic theorem provers for first-order logic typically require many…
Expand
Review
1994
Review
1994
A programming logic based on type theory
E. Poll
1994
Corpus ID: 221967522
• A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences…
Expand
1994
1994
Lambda calculus extended with segments
Harmannus Balsters
,
geboren te Groningen
1994
Corpus ID: 221967043
Highly Cited
1988
Highly Cited
1988
Computational Metatheory in Nuprl
Douglas J. Howe
CADE
1988
Corpus ID: 206839620
This paper describes an implementation within Nuprl of mechanisms that support the use of Nuprl's type theory as a language for…
Expand
Highly Cited
1973
Highly Cited
1973
Automath A Language for Mathematics
1973
Corpus ID: 122649446
AUTOMATH is a language intended for expressing detailed mathematical thoughts. It is not a programming language, although it has…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE