On the public citation graph

Do-it-yourself type theory

https://doi.org/10.1007/bf01887198
0 signed · 74 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-09724-4openalex-snapshot
Edinburgh LCF
inferredcites →https://doi.org/10.1007/3-540-15648-8_5openalex-snapshot
Recursive definitions in type theory
inferredcites →https://doi.org/10.1007/3-540-15983-5_13openalex-snapshot
Constructions: A higher order proof system for mechanizing mathematics
inferredcites →https://doi.org/10.1007/3-540-16446-4_12openalex-snapshot
Multilevel functions in Martin-Löf's type theory
inferredcites →https://doi.org/10.1007/978-1-4612-5983-1openalex-snapshot
The Science of Programming
inferredcites →https://doi.org/10.1007/978-1-4613-0897-3_25openalex-snapshot
On a Nonconstructive Type Theory and Program Derivation
inferredcites →https://doi.org/10.1007/978-1-4615-9984-5openalex-snapshot
PASCAL User Manual and Report
inferredcites →https://doi.org/10.1007/978-3-540-37500-5openalex-snapshot
PASCAL User Manual and Report
inferredcites →https://doi.org/10.1007/978-94-009-9825-4_2openalex-snapshot
Proofs and the Meaning and Completeness of the Logical Constants
inferredcites →https://doi.org/10.1007/978-94-011-3488-0_5openalex-snapshot
MJRTY—A Fast Majority Vote Algorithm
inferredcites →https://doi.org/10.1007/bf00244273openalex-snapshot
Writing programs that construct proofs
inferredcites →https://doi.org/10.1007/bf01383954openalex-snapshot
Type theory and concurrency
inferredcites →https://doi.org/10.1007/bf01941137openalex-snapshot
Terminating general recursion
inferredcites →https://doi.org/10.1007/springerreference_25828openalex-snapshot
structured programming
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0167-6423(82)90012-0openalex-snapshot
Finding repeated elements
inferredcites →https://doi.org/10.1016/0167-6423(87)90002-5openalex-snapshot
Derivation of a parsing algorithm in martin-löf's theory of types
inferredcites →https://doi.org/10.1016/s0049-237x(08)70822-xopenalex-snapshot
3. Investigations into Logical Deduction
inferredcites →https://doi.org/10.1016/s0049-237x(08)71945-1openalex-snapshot
An Intuitionistic Theory of Types: Predicative Part
inferredcites →https://doi.org/10.1016/s0049-237x(09)70189-2openalex-snapshot
Constructive Mathematics and Computer Programming
inferredcites →https://doi.org/10.1016/s0747-7171(86)80002-5openalex-snapshot
Constructing recursion operators in intuitionistic type theory
inferredcites →https://doi.org/10.1093/comjnl/32.2.98openalex-snapshot
Why Functional Programming Matters
inferredcites →https://doi.org/10.1112/blms/19.2.190openalex-snapshot
INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7)
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/138027.138060openalex-snapshot
A framework for defining logics
inferredcites →https://doi.org/10.1145/318593.318606openalex-snapshot
Abstract types have existential types
inferredcites →https://doi.org/10.1184/r1/6610514openalex-snapshot
The Craft of Programming
inferredcites →https://doi.org/10.2307/2274279openalex-snapshot
A natural extension of natural deduction

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44802-0_39openalex-snapshot
Normalized Types
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_40openalex-snapshot
Markov’s Principle for Propositional Type Theory
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_18openalex-snapshot
Quotient Types: A Modular Approach
inferred← citeshttps://doi.org/10.1007/3-540-52335-9_58openalex-snapshot
A formulation of the simple theory of types (for Isabelle)
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_9openalex-snapshot
Program specification and data refinement in type theory
inferred← citeshttps://doi.org/10.1007/978-1-4471-3756-6_18openalex-snapshot
Constructing and Refining Modules in a Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-81701-5_3openalex-snapshot
Algorithmics
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_35openalex-snapshot
Inductive-Inductive Definitions
inferred← citeshttps://doi.org/10.1007/978-3-642-46752-3_14openalex-snapshot
On Exploiting the Structure of Martin-Lof's Theory of Types
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_4openalex-snapshot
The Structure of Nuprl’s Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-74884-4_2openalex-snapshot
Constructive Type Theory—An Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-76677-0_27openalex-snapshot
Reusability of Transformational Developments
inferred← citeshttps://doi.org/10.1007/978-3-663-14621-6_11openalex-snapshot
Literatur
inferred← citeshttps://doi.org/10.1007/978-94-010-0413-8_7openalex-snapshot
Naïve Computational Type Theory
inferred← citeshttps://doi.org/10.1007/bf01211050openalex-snapshot
Semantics of under-determined expressions
inferred← citeshttps://doi.org/10.1007/bf01211308openalex-snapshot
Inductive families
inferred← citeshttps://doi.org/10.1007/bf01211391openalex-snapshot
Paramorphisms
inferred← citeshttps://doi.org/10.1007/bf01245632openalex-snapshot
Normalising the associative law: An experiment with Martin-Löf's type theory
inferred← citeshttps://doi.org/10.1007/bf01887204openalex-snapshot
Program development in the constructive set theory TK
inferred← citeshttps://doi.org/10.1007/bfb0013166openalex-snapshot
Analogical type theory
inferred← citeshttps://doi.org/10.1007/bfb0021082openalex-snapshot
Are subsets necessary in Martin-Löf type theory?
inferred← citeshttps://doi.org/10.1007/bfb0026991openalex-snapshot
Proof principles for datatypes with iterated recursion
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90058-lopenalex-snapshot
Comparing integrated and external logics of functional programs
inferred← citeshttps://doi.org/10.1016/0168-0072(92)90023-sopenalex-snapshot
An intuitionistic theory of types with assumptions of high-arity variables
inferred← citeshttps://doi.org/10.1016/j.apal.2013.07.009openalex-snapshot
Intuitionistic completeness of first-order logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.041openalex-snapshot
Formalizing Type Operations Using the “Image” Type Constructor
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)80018-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70234-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00309-7openalex-snapshot
A cartesian closed category in Martin-Löf's intuitionistic type theory
inferred← citeshttps://doi.org/10.1017/bsl.2019.21openalex-snapshot
ETA-RULES IN MARTIN-LÖF TYPE THEORY
inferred← citeshttps://doi.org/10.1017/cbo9780511526619.007openalex-snapshot
Operationally-Based Theories of Program Equivalence
inferred← citeshttps://doi.org/10.1017/s0960129500000256openalex-snapshot
Program specification and data refinement in type theory
inferred← citeshttps://doi.org/10.1093/jigpal/3.4.643openalex-snapshot
On the Proof Theory of Program Transformations
inferred← citeshttps://doi.org/10.1093/logcom/5.4.423openalex-snapshot
An Intensional Semantics for Elementary Program Transformations
inferred← citeshttps://doi.org/10.1093/oso/9780198537816.003.0004openalex-snapshot
Martin-Löf ’s type theory
inferred← citeshttps://doi.org/10.1109/32.58783openalex-snapshot
Specification and verification using dependent types
inferred← citeshttps://doi.org/10.1142/s0129054101000400openalex-snapshot
MARTIN-LÖF'S TYPE THEORY AS AN OPEN-ENDED FRAMEWORK
inferred← citeshttps://doi.org/10.1145/2187671.2187678openalex-snapshot
Behavioral interface specification languages
inferred← citeshttps://doi.org/10.1145/3379447openalex-snapshot
Typal Heterogeneous Equality Types
inferred← citeshttps://doi.org/10.1515/9783110324921.259openalex-snapshot
A Finite Axiomatisation of Inductive-Inductive Definitions
inferred← citeshttps://doi.org/10.15760/etd.2669openalex-snapshot
Irrelevance, Polymorphism, and Erasure in Type Theory
inferred← citeshttps://doi.org/10.17863/cam.47998openalex-snapshot
Typal Heterogeneous Equality Types
inferred← citeshttps://doi.org/10.2307/2275645openalex-snapshot
Tychonoff's theorem in the framework of formal topologies
inferred← citeshttps://doi.org/10.3233/fi-1996-26202openalex-snapshot
RECURSIVE MODELS OF GENERAL INDUCTIVE TYPES
inferred← citeshttps://doi.org/10.48456/tr-272openalex-snapshot
Interactive program derivation
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.