On the public citation graph
Propositions and specifications of programs in Martin-Löf's type theory
0 signed · 47 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-12689-9_125openalex-snapshot
The identification of propositions and types in Martin-Löf's type theory: A programming example
inferredcites →https://doi.org/10.1007/bf00247187openalex-snapshot
Constructions, proofs and the meaning of logical constants
inferredcites →https://doi.org/10.1007/bf01186549openalex-snapshot
Zur Deutung der intuitionistischen Logik
inferredcites →https://doi.org/10.1007/bfb0060620openalex-snapshot
Symposium on Automatic Demonstration
inferredcites →https://doi.org/10.1016/s0049-237x(08)70740-7openalex-snapshot
Mathematics as a Numerical Language
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(08)x7073-9openalex-snapshot
Intuitionism An Introduction
inferredcites →https://doi.org/10.1090/s0002-9904-1970-12455-7openalex-snapshot
Book Review: Foundations of constructive analysis
inferredcites →https://doi.org/10.1098/rsta.1984.0073openalex-snapshot
Constructive mathematics and computer programming
inferredcites →https://doi.org/10.1111/j.1746-8361.1958.tb01464.xopenalex-snapshot
Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/358728.358748openalex-snapshot
A critique of the foundations of Hoare style programming logics
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/800223.806773openalex-snapshot
Programming in Constructive Set Theory
inferredcites →https://doi.org/10.2307/2269016openalex-snapshot
On the interpretation of intuitionistic number theory
inferredcites →https://doi.org/10.2307/2314383openalex-snapshot
Foundations of Constructive Analysis.
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-16446-4_12openalex-snapshot
Multilevel functions in Martin-Löf's type theory
inferred← citeshttps://doi.org/10.1007/3-540-19129-1_6openalex-snapshot
PAP: a logic programming system based on a constructive logic
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_33openalex-snapshot
Induction in the elementary theory of types and names
inferred← citeshttps://doi.org/10.1007/3-540-50302-1_6openalex-snapshot
A specification language for reliable real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_142openalex-snapshot
Semi-constructive formal systems and axiomatization of abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_78openalex-snapshot
Towards the theory of programming in constructive logic
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_79openalex-snapshot
A theory of requirements capture and its applications
inferred← citeshttps://doi.org/10.1007/978-0-387-34848-3_13openalex-snapshot
Modelling the Requirements of Process Controlled Systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0897-3_25openalex-snapshot
On a Nonconstructive Type Theory and Program Derivation
inferred← citeshttps://doi.org/10.1007/978-3-642-41582-1_9openalex-snapshot
Dependently-typed programming in scientific computing: Examples from economic modelling
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/bf00246023openalex-snapshot
Proving termination of normalization functions for conditional expressions
inferred← citeshttps://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferred← citeshttps://doi.org/10.1007/bf01621473openalex-snapshot
Between constructive mathematics and PROLOG
inferred← citeshttps://doi.org/10.1007/bfb0035165openalex-snapshot
Higher order functions in first order logics
inferred← citeshttps://doi.org/10.1016/0096-0551(86)90009-3openalex-snapshot
Program derivation in type theory: A partitioning problem
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90025-6openalex-snapshot
The origin of a binary-search paradigm
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/0743-1066(86)90015-4openalex-snapshot
Natural deduction as higher-order resolution
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/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/s0747-7171(86)80002-5openalex-snapshot
Constructing recursion operators in intuitionistic type theory
inferred← citeshttps://doi.org/10.1109/hicss.1995.375712openalex-snapshot
Making the requirements of process controlled systems explicit
inferred← citeshttps://doi.org/10.1109/lics.2001.932478openalex-snapshot
Definitions by rewriting in the calculus of constructions
inferred← citeshttps://doi.org/10.1109/wvl.1991.238828openalex-snapshot
Visualizing an algebra of objects
inferred← citeshttps://doi.org/10.1142/9781848164581_0005openalex-snapshot
Curry–Howard Correspondence
inferred← citeshttps://doi.org/10.1360/02ye0122openalex-snapshot
A development calculus for specifications
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.