On the public citation graph

The mathematical language AUTOMATH, its usage, and some of its extensions

https://doi.org/10.1007/bfb0060623
0 signed · 168 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470050118.ecse212openalex-snapshot
Lambda‐Calculus
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse579openalex-snapshot
Proofs of Correctness in Mathematics and Industry
inferred← citeshttps://doi.org/10.1002/9781118882139.ch11openalex-snapshot
Constructive Type Theory
inferred← citeshttps://doi.org/10.1006/inco.1998.9999openalex-snapshot
A Note on Complexity Measures for Inductive Classes in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/11618027_15openalex-snapshot
Toward an Object-Oriented Structure for Mathematical Text
inferred← citeshttps://doi.org/10.1007/11814771_35openalex-snapshot
Formal Global Optimisation with Taylor Models
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_11openalex-snapshot
Lcf: A way of doing proofs with a machine
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_15openalex-snapshot
An approach to theorem proving on the basis of a typed lambda-calculus
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_4openalex-snapshot
Proofs as descriptions of computation
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_30openalex-snapshot
Computer aided reasoning
inferred← citeshttps://doi.org/10.1007/3-540-36137-5_4openalex-snapshot
On Functions and Types: A Tutorial
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_24openalex-snapshot
Refining the Barendregt Cube using Parameters
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_24openalex-snapshot
The Girard-Reynolds Isomorphism
inferred← citeshttps://doi.org/10.1007/3-540-51564-x_63openalex-snapshot
EUODHILOS: A general-purpose reasoning assistant system — Concept and implementation —
inferred← citeshttps://doi.org/10.1007/3-540-52335-9_45openalex-snapshot
The use of justification systems for integrated semantics
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_9openalex-snapshot
Extraction of strong typing laws from action semantics definitions
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_108openalex-snapshot
The Gallina specification language: A case study
inferred← citeshttps://doi.org/10.1007/3-540-56320-2_55openalex-snapshot
Formal theories and software systems: Fundamental connections between Computer Science and Logic
inferred← citeshttps://doi.org/10.1007/3-540-57292-9_37openalex-snapshot
Building and executing proof strategies in a formal metatheory
inferred← citeshttps://doi.org/10.1007/3-540-58450-1_36openalex-snapshot
Highlighting the lambda-free fragment of Automath
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_82openalex-snapshot
Expressing computational complexity in constructive type theory
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_34openalex-snapshot
Representing unification in a logical framework
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_8openalex-snapshot
Some Remarks About Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-42753-4_1openalex-snapshot
Large-Scale Formal Proof for the Working Mathematician—Lessons Learnt from the ALEXANDRIA Project
inferred← citeshttps://doi.org/10.1007/978-3-032-35078-7_23openalex-snapshot
Formalizing All Indexed Mathematics as a Benchmark for General Reasoning: Implementing Dilatations of Categories
inferred← citeshttps://doi.org/10.1007/978-3-319-00966-7_1openalex-snapshot
Foundations of Mathematics from the Perspective of Computer Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-20297-6_17openalex-snapshot
Automath Type Inclusion in Barendregt’s Cube
inferred← citeshttps://doi.org/10.1007/978-3-319-32667-2_3openalex-snapshot
Wikis and Collaborative Systems for Large Formal Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_1openalex-snapshot
Type Theory and Formalisation of Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-540-24849-1_21openalex-snapshot
Mobility Types in Coq
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_11openalex-snapshot
A Path to Faithful Formalizations of Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_15openalex-snapshot
Predicate Logic with Sequence Variables and Sequence Function Symbols
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_20openalex-snapshot
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_4openalex-snapshot
Theorem Proving for Verification (Invited Tutorial)
inferred← citeshttps://doi.org/10.1007/978-3-540-73433-8_24openalex-snapshot
A Short Survey of Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_3openalex-snapshot
Trust and Automation in Verification Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-39320-4_1openalex-snapshot
The Rooster and the Butterflies
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_3openalex-snapshot
Problems in Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_9openalex-snapshot
Computers, Reasoning and Mathematical Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_11openalex-snapshot
AUTOMATH, a Language for Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-642-87374-4_12openalex-snapshot
Deduction and Computation
inferred← citeshttps://doi.org/10.1007/978-3-662-40145-3_2openalex-snapshot
Deduction and Computation
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_5openalex-snapshot
Logical Frameworks—A Brief Introduction
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9openalex-snapshot
Thirty Five Years of Automating Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_3openalex-snapshot
Recent Results in Type Theory and Their Relationship to Automath
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_4openalex-snapshot
Linear Contexts, Sharing Functors: Techniques for Symbolic Computation
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_5openalex-snapshot
De Bruijn’s Automath and Pure Type Systems
inferred← citeshttps://doi.org/10.1007/978-94-017-0460-1_3openalex-snapshot
Combinators, Proofs and Implicational Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-1592-8_13openalex-snapshot
Realizability and Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_4openalex-snapshot
Building a Correct-by-Construction Type Checker for a Dependently Typed Core Language
inferred← citeshttps://doi.org/10.1007/bf00244273openalex-snapshot
Writing programs that construct proofs
inferred← citeshttps://doi.org/10.1007/bf00297249openalex-snapshot
Inference rules using local contexts
inferred← citeshttps://doi.org/10.1007/bf00485463openalex-snapshot
Realizability and intuitionistic logic
inferred← citeshttps://doi.org/10.1007/bf00627403openalex-snapshot
Intuitionistic categorial grammar
inferred← citeshttps://doi.org/10.1007/bf01131860openalex-snapshot
Inherited extension of many-sorted theories
inferred← citeshttps://doi.org/10.1007/bf01530803openalex-snapshot
Embedding complex decision procedures inside an interactive theorem prover
inferred← citeshttps://doi.org/10.1007/bf03024381openalex-snapshot
What does logic have to tell us about mathematical proofs?
inferred← citeshttps://doi.org/10.1007/bfb0012835openalex-snapshot
Computational metatheory in Nuprl
inferred← citeshttps://doi.org/10.1007/bfb0023884openalex-snapshot
MSL — A Mathematical Specification Language
inferred← citeshttps://doi.org/10.1007/bfb0029530openalex-snapshot
Big trees in a λ-calculus with λ-expressions as types
inferred← citeshttps://doi.org/10.1007/bfb0049337openalex-snapshot
Data types, infinity and equality in system AF 2
inferred← citeshttps://doi.org/10.1007/bfb0097791openalex-snapshot
Proof style
inferred← citeshttps://doi.org/10.1007/s00283-012-9324-xopenalex-snapshot
N.G. de Bruijn (1918–2012) and his Road to Automath, the Earliest Proof Checker
inferred← citeshttps://doi.org/10.1007/s00283-020-10006-0openalex-snapshot
Big Math and the One-Brain Barrier: The Tetrapod Model of Mathematical Knowledge
inferred← citeshttps://doi.org/10.1007/s10516-022-09645-zopenalex-snapshot
On the Experimental Foundation of Computing
inferred← citeshttps://doi.org/10.1007/s10817-017-9440-6openalex-snapshot
The Role of the Mizar Mathematical Library for Interactive Proof Development in Mizar
inferred← citeshttps://doi.org/10.1016/0168-0072(94)00058-bopenalex-snapshot
Understanding uniformity in Feferman's explicit mathematics
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90109-xopenalex-snapshot
Typing and computational properties of lambda expressions
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90115-6openalex-snapshot
Towards a computation system based on set theory
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00127-5openalex-snapshot
A unified approach to type theory through a refined λ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00101-8openalex-snapshot
A useful λ-notation
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90066-bopenalex-snapshot
Telescopic mappings in typed lambda calculus
inferred← citeshttps://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-0-444-87508-2.50035-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50019-9openalex-snapshot
Logical Frameworks
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50020-5openalex-snapshot
Proof-Assistants Using Dependent Type Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.024openalex-snapshot
PlatΩ: A Mediator between Text-Editors and Proof Assistance Systems
inferred← citeshttps://doi.org/10.1016/j.indag.2013.09.004openalex-snapshot
Nicolaas Govert de Bruijn (1918–2012) Mathematician, computer scientist, logician
inferred← citeshttps://doi.org/10.1016/j.indag.2018.04.003openalex-snapshot
Combinatorial topology and constructive mathematics
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.005openalex-snapshot
Innovations in computational type theory using Nuprl
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.010openalex-snapshot
Supporting the formal verification of mathematical texts
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.09.040openalex-snapshot
Towards semantic mathematical editing
inferred← citeshttps://doi.org/10.1016/j.pragma.2020.02.001openalex-snapshot
Some remarks on pragmatics in the language of mathematics
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.042openalex-snapshot
The Girard–Reynolds isomorphism (second edition)
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.12.015openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1016/j.websem.2011.11.008openalex-snapshot
Higher-order aspects and context in SUMO
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80005-4openalex-snapshot
The Curry-Howard isomorphism
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80009-1openalex-snapshot
First-order logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80014-5openalex-snapshot
Dependent types
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70234-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70551-8openalex-snapshot
Concepts Mathématiques et Informatiques Formalisés dans le Calcul des Constructions
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80025-6openalex-snapshot
Types in Logic, Mathematics and Programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00347-9openalex-snapshot
Inductive-data-type systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00172-2openalex-snapshot
From constructivism to computer science
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00086-9openalex-snapshot
On principal types of combinators
inferred← citeshttps://doi.org/10.1016/s0747-7171(85)80040-7openalex-snapshot
A Selected Bibliography on Constructive Mathematics, Intuitionistic Type Theory and Higher Order Deduction
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00141-xopenalex-snapshot
The Girard–Reynolds isomorphism
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00016-4openalex-snapshot
Revisiting the notion of function
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80756-4openalex-snapshot
Automath and Pure Type Systems
inferred← citeshttps://doi.org/10.1017/bsl.2017.43openalex-snapshot
POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE
inferred← citeshttps://doi.org/10.1017/cbo9781139567725openalex-snapshot
Type Theory and Formal Proof: An Introduction
inferred← citeshttps://doi.org/10.1017/s095679680500554xopenalex-snapshot
Typed $\lambda$-calculi with one binder
inferred← citeshttps://doi.org/10.1017/s0956796818000072openalex-snapshot
Size-based termination of higher-order rewriting
inferred← citeshttps://doi.org/10.1017/s0960129511000144openalex-snapshot
Formalising foundations of mathematics
inferred← citeshttps://doi.org/10.1017/s0960129512000424openalex-snapshot
A logical framework combining model and proof theory
inferred← citeshttps://doi.org/10.1017/s0960129514000140openalex-snapshot
A light-weight integration of automated and interactive theorem proving
inferred← citeshttps://doi.org/10.1017/s0960129518000440openalex-snapshot
A general proof certification framework for modal logic
inferred← citeshttps://doi.org/10.1017/s175502031900056xopenalex-snapshot
NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF
inferred← citeshttps://doi.org/10.1023/a:1014408032446openalex-snapshot
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition
inferred← citeshttps://doi.org/10.1023/a:1015761529444openalex-snapshot
Autarkic Computations in Formal Proofs
inferred← citeshttps://doi.org/10.1023/a:1021977414812openalex-snapshot
Preface: Mechanizing and Automating Mathematics: In honour of N.G. de Bruijn
inferred← citeshttps://doi.org/10.1023/b:jlli.0000028393.47593.b8openalex-snapshot
A Refinement of de Bruijn's Formal Language of Mathematics
inferred← citeshttps://doi.org/10.1090/bull/1616openalex-snapshot
An introduction to univalent foundations for mathematicians
inferred← citeshttps://doi.org/10.1093/jigpal/4.2.159openalex-snapshot
Maps II: Chasing Diagrams in Categorical Proof Theory
inferred← citeshttps://doi.org/10.1093/oso/9780198537816.003.0004openalex-snapshot
Martin-Löf ’s type theory
inferred← citeshttps://doi.org/10.1098/rsif.2011.0616openalex-snapshot
A formal mathematical framework for physiological observations, experiments and analyses
inferred← citeshttps://doi.org/10.1098/rsta.1984.0073openalex-snapshot
Constructive mathematics and computer programming
inferred← citeshttps://doi.org/10.1109/is.2006.348446openalex-snapshot
The SAD System: Deductive Assistance in an Intelligent Linguistic Environment
inferred← citeshttps://doi.org/10.1109/lics.1995.523262openalex-snapshot
Experience using type theory as a foundation for computer science
inferred← citeshttps://doi.org/10.1109/lics.2003.1210048openalex-snapshot
Dependent intersection: a new way of defining records in type theory
inferred← citeshttps://doi.org/10.1109/lics.2012.9openalex-snapshot
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470649openalex-snapshot
A Constructive Logic with Classical Proofs and Refutations
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203057openalex-snapshot
The early search for tractable ways of reasoning about programs
inferred← citeshttps://doi.org/10.1109/sfcs.1980.36openalex-snapshot
Programs and types
inferred← citeshttps://doi.org/10.1142/9789813272880_0038openalex-snapshot
MACHINE-ASSISTED PROOFS
inferred← citeshttps://doi.org/10.1142/9789814368452_0004openalex-snapshot
The Constructive Engine
inferred← citeshttps://doi.org/10.1145/1592434.1592437openalex-snapshot
Automated deduction for verification
inferred← citeshttps://doi.org/10.1145/1614431.1614436openalex-snapshot
The formal system λδ
inferred← citeshttps://doi.org/10.1145/1731022.1731026openalex-snapshot
Efficient and formally proven reduction of large integers by small moduli
inferred← citeshttps://doi.org/10.1145/2699407openalex-snapshot
Propositions as types
inferred← citeshttps://doi.org/10.1145/321752.321764openalex-snapshot
A Complete Mechanization of Second-Order Type Theory
inferred← citeshttps://doi.org/10.1145/3242953.3242962openalex-snapshot
A survey of constructive presheaf models of univalence
inferred← citeshttps://doi.org/10.1145/567752.567754openalex-snapshot
A PL/CV precis
inferred← citeshttps://doi.org/10.1145/944705.944723openalex-snapshot
Call-by-value is dual to call-by-name
inferred← citeshttps://doi.org/10.1145/976571.976579openalex-snapshot
Representing reductions of NP-complete problems in logical frameworks
inferred← citeshttps://doi.org/10.1184/r1/6604463openalex-snapshot
Contracting proofs to programs
inferred← citeshttps://doi.org/10.14236/ewic/vocs2010.3openalex-snapshot
Finding Unity in Computational Logic
inferred← citeshttps://doi.org/10.14264/7583d15openalex-snapshot
A generic proof checker
inferred← citeshttps://doi.org/10.1515/9781400836123-031openalex-snapshot
Why Do We Believe Theorems
inferred← citeshttps://doi.org/10.1515/dmvm-2025-0058openalex-snapshot
Algebra, Logik und Beweisvisualisierung
inferred← citeshttps://doi.org/10.1561/2500000045openalex-snapshot
QED at Large: A Survey of Engineering of Formally Verified Software
inferred← citeshttps://doi.org/10.17077/etd.vibd09toopenalex-snapshot
The semantic analysis of advanced programming languages
inferred← citeshttps://doi.org/10.18725/oparu-3openalex-snapshot
Construction and deduction in type theories
inferred← citeshttps://doi.org/10.20381/ruor-13147openalex-snapshot
Abstraction-based genetic programming
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.22028/d291-26649openalex-snapshot
A machine-checked constructive metatheory of computation tree logic
inferred← citeshttps://doi.org/10.2307/421013openalex-snapshot
The Impact of the Lambda Calculus in Logic and Computer Science
inferred← citeshttps://doi.org/10.2307/j.ctv1t1kg73.33openalex-snapshot
Why Do We Believe Theorems?
inferred← citeshttps://doi.org/10.25236/ajcis.2020.030104openalex-snapshot
Research on Solving Assignment Problem Based on Linear Programming Modeling
inferred← citeshttps://doi.org/10.29007/d2dfopenalex-snapshot
Proof Assistants and the Dynamic Nature of Formal Theories
inferred← citeshttps://doi.org/10.2977/prims/1195182986openalex-snapshot
A Proof Description Language and Its Reduction System
inferred← citeshttps://doi.org/10.3233/fi-222112openalex-snapshot
Characteristics of de Bruijn's early proof checker Automath
inferred← citeshttps://doi.org/10.4249/scholarpedia.7618openalex-snapshot
Computational type theory
inferred← citeshttps://doi.org/10.48456/tr-566openalex-snapshot
Formal verification of probabilistic algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1606.04442openalex-snapshot
DeepMath - Deep Sequence Models for Premise Selection
inferred← citeshttps://doi.org/10.48550/arxiv.1607.01817openalex-snapshot
A System of Dependent Types, with an Implementation and a Philosophy
inferred← citeshttps://doi.org/10.48550/arxiv.1904.10405openalex-snapshot
Big Math and the One-Brain Barrier A Position Paper and Architecture Proposal
inferred← citeshttps://doi.org/10.48550/arxiv.2104.04589openalex-snapshot
A Constructive Logic with Classical Proofs and Refutations (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610068openalex-snapshot
Type theory and rewriting
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0611040openalex-snapshot
The Formal System lambda-delta
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/1710openalex-snapshot
Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/4552openalex-snapshot
Mixing Computations and Proofs
inferred← citeshttps://doi.org/10.70675/0fbba6fbz729az49fdzbf9azfc9f951aa0b0openalex-snapshot
Extraction de code fonctionnel certifié à partir de spécifications inductives
inferred← citeshttps://doi.org/10.70675/3f4ad046z6aecz4343za218z6c2ec0fbc3f7openalex-snapshot
Combining computational theories
inferred← citeshttps://doi.org/10.70675/5b3981d5zd1ecz4a42za770z3ef7f54f2c8fopenalex-snapshot
Integrating Automated Theorem Provers in Proof Assistants
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.