On the public citation graph
IMPS: An interactive mathematical proof system
0 signed · 162 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52885-7_120openalex-snapshot
The TPS theorem proving system
inferredcites →https://doi.org/10.1007/3-540-55602-8_154openalex-snapshot
The central variable strategy of str∔ve
inferredcites →https://doi.org/10.1007/3-540-55602-8_217openalex-snapshot
PVS: A prototype verification system
inferredcites →https://doi.org/10.1007/3-540-55602-8_220openalex-snapshot
Analytica — A theorem prover in mathematica
inferredcites →https://doi.org/10.1007/978-1-4613-2007-4_3openalex-snapshot
HOL: A Proof Generating System for Higher-Order Logic
inferredcites →https://doi.org/10.1007/978-3-0346-0145-0_26openalex-snapshot
Introducing Institutions
inferredcites →https://doi.org/10.1007/bf00297249openalex-snapshot
Inference rules using local contexts
inferredcites →https://doi.org/10.1007/bfb0013080openalex-snapshot
Unification in order-sorted type theory
inferredcites →https://doi.org/10.1007/bfb0099491openalex-snapshot
Abstract recursion as a foundation for the theory of algorithms
inferredcites →https://doi.org/10.1016/0168-0072(93)90144-3openalex-snapshot
A simple type theory with partial functions and subtypes11Supported by the MITRE-Sponsored Research program. Presented at the 9th International Congress of Logic, Methodology and Philosophy of Science held in Uppsala, Sweden, August 7-14, 1991.
inferredcites →https://doi.org/10.1016/0890-5401(88)90005-3openalex-snapshot
The calculus of constructions
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7092-2openalex-snapshot
Elementary Induction on Abstract Structures
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6009-xopenalex-snapshot
Foundations of Modern Analysis
inferredcites →https://doi.org/10.1090/conm/029/06openalex-snapshot
Some Automatic Proofs in Analysis
inferredcites →https://doi.org/10.1098/rsta.1984.0073openalex-snapshot
Constructive mathematics and computer programming
inferredcites →https://doi.org/10.1109/hol.1991.596285openalex-snapshot
Window Inference In The HOL System
inferredcites →https://doi.org/10.1145/12276.13333openalex-snapshot
ORBIT: an optimizing compiler for scheme
inferredcites →https://doi.org/10.1145/6041.6042openalex-snapshot
On understanding types, data abstraction, and polymorphism
inferredcites →https://doi.org/10.1145/73103.73110openalex-snapshot
Principles of parameterized programming
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2272708openalex-snapshot
Bertrand Russell. Mathematical logic as based on the theory of types. A reprint of the first five sections of 11116. Contemporary readings in logical theory, edited by Irving M. Copi and James A. Gould, The Macmillan Company, New York, and Collier-Macmillan Limited, London, 1967, pp. 135–153.
inferredcites →https://doi.org/10.2307/2274326openalex-snapshot
Second-order languages and mathematical practice
inferredcites →https://doi.org/10.2307/2274454openalex-snapshot
Peter B. Andrews. An introduction to mathematical logic and type theory: to truth through proof. Computer science and applied mathematics. Academic Press, Orlando etc. 1986, xv + 304 pp.
inferredcites →https://doi.org/10.2307/2274487openalex-snapshot
A partial functions version of Church's simple theory of types
inferredcites →https://doi.org/10.2307/2369948openalex-snapshot
Mathematical Logic as Based on the Theory of Types
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.2000.0468openalex-snapshot
MBase: Representing Knowledge and Context for the Integration of Mathematical Software Systems
inferred← citeshttps://doi.org/10.1007/10721959_8openalex-snapshot
An Infrastructure for Intertheory Reasoning
inferred← citeshttps://doi.org/10.1007/10930755_15openalex-snapshot
First Order Logic with Domain Conditions
inferred← citeshttps://doi.org/10.1007/11589976_15openalex-snapshot
Embedding the Stable Failures Model of CSP in PVS
inferred← citeshttps://doi.org/10.1007/11618027_20openalex-snapshot
Gröbner Bases — Theory Refinement in the Mizar System
inferred← citeshttps://doi.org/10.1007/11812289_9openalex-snapshot
Synthesizing Proof Planning Methods and Ω-Ants Agents from Mathematical Knowledge
inferred← citeshttps://doi.org/10.1007/11826095openalex-snapshot
OMDoc – An Open Markup Format for Mathematical Documents [version 1.2]
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_14openalex-snapshot
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_9openalex-snapshot
A ‘Theory’ Mechanism for a Proof-Verifier Based on First-Order Set Theory
inferred← citeshttps://doi.org/10.1007/3-540-48167-2_9openalex-snapshot
Modular Structures as Dependent Types in Isabelle
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_11openalex-snapshot
Locales A Sectioning Concept for Isabelle
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_11openalex-snapshot
A fixedpoint approach to implementing (Co)inductive definitions
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_25openalex-snapshot
Proof script pragmatics in IMPS
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_26openalex-snapshot
A mechanization of strong Kleene logic for partial functions
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_6openalex-snapshot
Theory interpretation in simple type theory
inferred← citeshttps://doi.org/10.1007/3-540-58555-9_108openalex-snapshot
An experimental support system for formal mathematical reasoning
inferred← citeshttps://doi.org/10.1007/3-540-58555-9_87openalex-snapshot
Three applications of formal methods at MITRE
inferred← citeshttps://doi.org/10.1007/3-540-60275-5_55openalex-snapshot
Experiments with ZF set theory in HOL and Isabelle
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_94openalex-snapshot
IMPS: An updated system description
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_23openalex-snapshot
Structures for symbolic mathematical reasoning and computation
inferred← citeshttps://doi.org/10.1007/978-1-4615-2339-0_2openalex-snapshot
The VLISP Verified Scheme System
inferred← citeshttps://doi.org/10.1007/978-3-030-23220-7_9openalex-snapshot
Structuring Theories with Implicit Morphisms
inferred← citeshttps://doi.org/10.1007/978-3-030-53518-6_9openalex-snapshot
A Survey of Languages for Formalizing Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-030-73785-6_8openalex-snapshot
Structure-Preserving Diagram Operators
inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_12openalex-snapshot
Formal Methods and Mathematical Intuition
inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_19openalex-snapshot
Joshua Guttman: Pioneering Strand Spaces
inferred← citeshttps://doi.org/10.1007/978-3-031-42753-4_12openalex-snapshot
Morphism Equality in Theory Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-55248-9_2openalex-snapshot
Onset and Today’s Perspectives of Multilevel Syllogistic
inferred← citeshttps://doi.org/10.1007/978-3-032-07021-0_14openalex-snapshot
Global, Regional, and Local Contexts
inferred← citeshttps://doi.org/10.1007/978-3-032-38214-6_17openalex-snapshot
A Toolbox for Undefined Terms in Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-08434-3_26openalex-snapshot
Towards Knowledge Management for HOL Light
inferred← citeshttps://doi.org/10.1007/978-3-319-20615-8_15openalex-snapshot
Automating Change of Representation for Proofs in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-319-62075-6_2openalex-snapshot
Formalizing Mathematical Knowledge as a Biform Theory Graph: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-319-96812-4_18openalex-snapshot
Automatically Finding Theory Morphisms for Knowledge Management
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_35openalex-snapshot
Formalizing Undefinedness Arising in Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_10openalex-snapshot
Rough Concept Analysis – Theory Development in the Mizar System
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_8openalex-snapshot
Notes from the Logbook of a Proof-Checker’s Project*
inferred← citeshttps://doi.org/10.1007/978-3-540-73086-6_3openalex-snapshot
Context Aware Calculation and Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-92995-6_4openalex-snapshot
Toward a Practical Module System for ACL2
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_3openalex-snapshot
Theory-Specific Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_12openalex-snapshot
Partiality and Recursion in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-7091-9461-4_2openalex-snapshot
A Tableau Calculus for Partial Functions
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_14openalex-snapshot
Cooperating Theorem Provers
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_10openalex-snapshot
Implementing Semantic Tableaux
inferred← citeshttps://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferred← citeshttps://doi.org/10.1007/bf01135375openalex-snapshot
Reasoning about partial functions with the aid of a computer
inferred← citeshttps://doi.org/10.1007/bf01211052openalex-snapshot
An approach to literate and structured formal developments
inferred← citeshttps://doi.org/10.1007/bfb0030645openalex-snapshot
TYPELAB: An environment for modular program development
inferred← citeshttps://doi.org/10.1007/bfb0054262openalex-snapshot
ACL2 support for verification projects
inferred← citeshttps://doi.org/10.1007/bfb0105402openalex-snapshot
Elements of mathematical analysis in PVS
inferred← citeshttps://doi.org/10.1007/bfb0105405openalex-snapshot
Set theory, higher order logic or both?
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/s10817-004-3997-6openalex-snapshot
Organizing Numerical Theories Using Axiomatic Type Classes
inferred← citeshttps://doi.org/10.1007/s10817-009-9138-5openalex-snapshot
Crystal: Integrating Structured Queries into a Tactic Language
inferred← citeshttps://doi.org/10.1007/s10817-010-9202-1openalex-snapshot
State and Progress in Strand Spaces: Proving Fair Exchange
inferred← citeshttps://doi.org/10.1007/s10817-012-9253-6openalex-snapshot
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions
inferred← citeshttps://doi.org/10.1007/s10817-017-9412-xopenalex-snapshot
A Formalization of Metric Spaces in HOL Light
inferred← citeshttps://doi.org/10.1007/s10817-021-09604-0openalex-snapshot
Experiences from Exporting Major Proof Assistant Libraries
inferred← citeshttps://doi.org/10.1007/s11786-016-0275-zopenalex-snapshot
Automating Change of Representation for Proofs in Discrete Mathematics (Extended Version)
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90144-3openalex-snapshot
A simple type theory with partial functions and subtypes11Supported by the MITRE-Sponsored Research program. Presented at the 9th International Congress of Logic, Methodology and Philosophy of Science held in Uppsala, Sweden, August 7-14, 1991.
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50005-8openalex-snapshot
Automation of Higher-Order Logic
inferred← citeshttps://doi.org/10.1016/j.ic.2018.03.001openalex-snapshot
Incorporating quotation and evaluation into Church's type theory
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.002openalex-snapshot
TPS: A hybrid automatic-interactive system for developing proofs
inferred← citeshttps://doi.org/10.1016/j.jal.2007.11.001openalex-snapshot
The seven virtues of simple type theory
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.02.003openalex-snapshot
Decision algorithms for fragments of real analysis. I. Continuous functions with strict convexity and concavity predicates
inferred← citeshttps://doi.org/10.1016/s0378-4754(97)00087-6openalex-snapshot
Computer algebra and artificial intelligence
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80648-0openalex-snapshot
Deduction as an Engineering Science
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80615-2openalex-snapshot
MBase: Representing mathematical Knowledge in a Relational Data Base
inferred← citeshttps://doi.org/10.1017/s0960129511000144openalex-snapshot
Formalising foundations of mathematics
inferred← citeshttps://doi.org/10.1017/s0960129514000115openalex-snapshot
Partiality and recursion in interactive theorem provers – an overview
inferred← citeshttps://doi.org/10.1017/s0960129516000104openalex-snapshot
A realizability interpretation of Church's simple theory of types
inferred← citeshttps://doi.org/10.1023/a:1006086330571openalex-snapshot
Triple Dots in a Formal Language
inferred← citeshttps://doi.org/10.1023/a:1006269330992openalex-snapshot
A Formal Proof of Sylow's Theorem
inferred← citeshttps://doi.org/10.1023/a:1006437704595openalex-snapshot
STMM: A Set Theory for Mechanized Mathematics
inferred← citeshttps://doi.org/10.1023/a:1022924032739openalex-snapshot
Designing Mathematical Libraries Based on Requirements for Theorems
inferred← citeshttps://doi.org/10.1023/a:1022971915900openalex-snapshot
An Overview of a Formal Framework for Managing Mathematics
inferred← citeshttps://doi.org/10.1023/a:1026744827863openalex-snapshot
A Set Theory with Support for Partial Functions
inferred← citeshttps://doi.org/10.1049/ip-sen:20060011openalex-snapshot
Deriving specifications from requirements through problem reduction
inferred← citeshttps://doi.org/10.1093/logcom/7.2.175openalex-snapshot
Mechanizing coinduction and corecursion in higher-order logic
inferred← citeshttps://doi.org/10.1093/logcom/8.1.5openalex-snapshot
A module system for a programming language based on the LF logical framework
inferred← citeshttps://doi.org/10.1109/32.588534openalex-snapshot
An industrial strength theorem prover for a logic based on Common Lisp
inferred← citeshttps://doi.org/10.1109/32.713327openalex-snapshot
Subtypes for specifications: predicate subtyping in PVS
inferred← citeshttps://doi.org/10.1109/cgc.2013.34openalex-snapshot
VMCloner: A Fast and Flexible Virtual Machine Cloner
inferred← citeshttps://doi.org/10.1109/fie.2004.1408559openalex-snapshot
Simple type theory: simple steps towards a formal specification
inferred← citeshttps://doi.org/10.1145/1577824.1577831openalex-snapshot
A practical module system for LF
inferred← citeshttps://doi.org/10.1145/1599410.1599424openalex-snapshot
Making induction manifest in modular ACL2
inferred← citeshttps://doi.org/10.1145/178243.178261openalex-snapshot
Cache performance of garbage-collected programs
inferred← citeshttps://doi.org/10.14236/ewic/iwfm1999.5openalex-snapshot
A Scheme for Defining Partial Higher-Order Functions by Recursion
inferred← citeshttps://doi.org/10.14279/depositonce-3248openalex-snapshot
Mechanical Verification of Parameterized Real-Time Systems
inferred← citeshttps://doi.org/10.1609/aimag.v20i1.1442openalex-snapshot
Automated Deduction: Looking Ahead
inferred← citeshttps://doi.org/10.18725/oparu-3openalex-snapshot
Construction and deduction in type theories
inferred← citeshttps://doi.org/10.21954/ou.ro.0001604dopenalex-snapshot
Problem Oriented Software Engineering
inferred← citeshttps://doi.org/10.22028/d291-25745openalex-snapshot
Omega-ants: A blackboard architecture for the integration of reasoning techniques into proof planning
inferred← citeshttps://doi.org/10.22028/d291-25891openalex-snapshot
A mechanization of sorted higher-order logic based on the resolution principle
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.4204/eptcs.262.7openalex-snapshot
Alignment-based Translations Across Formal Systems Using Interface Theories
inferred← citeshttps://doi.org/10.4204/eptcs.328.5openalex-snapshot
Lucas-Interpretation on Isabelle's Functions
inferred← citeshttps://doi.org/10.48456/tr-452openalex-snapshot
A formal proof of Sylow’s theorem An experiment in abstract algebra with Isabelle HOL
inferred← citeshttps://doi.org/10.48550/arxiv.1106.1862openalex-snapshot
The MathScheme Library: Some Preliminary Experiments
inferred← citeshttps://doi.org/10.48550/arxiv.1406.6706openalex-snapshot
Simple Type Theory with Undefinedness, Quotation, and Evaluation
inferred← citeshttps://doi.org/10.48550/arxiv.1406.7492openalex-snapshot
Andrews' Type Theory with Undefinedness
inferred← citeshttps://doi.org/10.48550/arxiv.1505.02449openalex-snapshot
Automating change of representation for proofs in discrete mathematics
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9612104openalex-snapshot
Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of Choice.
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9711105openalex-snapshot
Mechanizing Coinduction and Corecursion in Higher-order Logic
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/4552openalex-snapshot
Mixing Computations and Proofs
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/4570openalex-snapshot
QED Reloaded: Towards a Pluralistic Formal Library of Mathematical Knowledge
inferred← citeshttps://doi.org/10.71548/22899openalex-snapshot
Mei-A Module System for Mechanized Mathematics Systems
inferred← citeshttps://doi.org/10.71548/24543openalex-snapshot
Algebraic Constructions Applied to Theories
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0013openalex-snapshot
A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions
inferred← citeshttps://doi.org/10.7907/z94t6gb8openalex-snapshot
Formalizing Abstract Algebra in Constructive Set Theory
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.