On the public citation graph
Epigram: Practical Programming with Dependent Types
0 signed · 106 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-48168-0_32openalex-snapshot
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
inferredcites →https://doi.org/10.1007/3-540-58085-9_78openalex-snapshot
The Alf proof editor and its proof engine
inferredcites →https://doi.org/10.1007/3-540-60579-7_3openalex-snapshot
Codifying guarded definitions with recursive schemes
inferredcites →https://doi.org/10.1007/3-540-60675-0_35openalex-snapshot
Elementary strong functional programming
inferredcites →https://doi.org/10.1007/978-3-642-61455-2_12openalex-snapshot
The Algebra of Programming
inferredcites →https://doi.org/10.1007/978-3-662-07964-5openalex-snapshot
Interactive Theorem Proving and Program Development
inferredcites →https://doi.org/10.1016/0167-6423(94)00022-0openalex-snapshot
Substitution: A formal methods case study using monads and transformations
inferredcites →https://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
inferredcites →https://doi.org/10.1017/cbo9780511530104openalex-snapshot
Purely Functional Data Structures
inferredcites →https://doi.org/10.1017/cbo9780511569807.012openalex-snapshot
Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics
inferredcites →https://doi.org/10.1017/s0956796800003658openalex-snapshot
Do we need dependent types?
inferredcites →https://doi.org/10.1017/s0956796801004191openalex-snapshot
A predicative analysis of structural recursion
inferredcites →https://doi.org/10.1017/s0956796802004355openalex-snapshot
Faking it Simulating dependent types in Haskell
inferredcites →https://doi.org/10.1017/s0956796803004957openalex-snapshot
First-order unification by structural recursion
inferredcites →https://doi.org/10.1017/s0956796899003366openalex-snapshot
de Bruijn notation as a nested datatype
inferredcites →https://doi.org/10.1017/s095679689922326xopenalex-snapshot
Algebra of Programming by Richard Bird and Oege de Moor, Prentice Hall, 1996 (dated 1997).
inferredcites →https://doi.org/10.1093/oso/9780198538356.001.0001openalex-snapshot
Computation and Reasoning
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/277650.277732openalex-snapshot
Eliminating array bound checking through dependent types
inferredcites →https://doi.org/10.1145/289423.289451openalex-snapshot
Cayenne—a language with dependent types
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferredcites →https://doi.org/10.1145/317636.317781openalex-snapshot
From fast exponentiation to square matrices
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/41625.41653openalex-snapshot
Views: a way for pattern matching to cohabit with data abstraction
inferredcites →https://doi.org/10.5860/choice.32-5698openalex-snapshot
Computation and reasoning: a type theory for computer science
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11617990_12openalex-snapshot
A Few Constructions on Constructors
inferred← citeshttps://doi.org/10.1007/11964681_5openalex-snapshot
A Dependently Typed Framework for Static Analysis of Program Execution Costs
inferred← citeshttps://doi.org/10.1007/978-3-031-74558-4_2openalex-snapshot
Free Monads, Intrinsic Scoping, and Higher-Order Preunification
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_11openalex-snapshot
Coverage Semantics for Dependent Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_2openalex-snapshot
Deep Induction for Inductive Families
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_8openalex-snapshot
Congruence Closure in Intensional Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-46559-3_2openalex-snapshot
Using Dependent Types to Define Energy Augmented Semantics of Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-74130-5_10openalex-snapshot
Proving Program Properties Specified with Subtype Marks
inferred← citeshttps://doi.org/10.1007/978-3-540-76786-2_2openalex-snapshot
Comparing Approaches to Generic Programming in Haskell
inferred← citeshttps://doi.org/10.1007/978-3-540-76786-2_4openalex-snapshot
Generic Programming with Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-540-76786-2_5openalex-snapshot
Generic Programming in Ωmega
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_3openalex-snapshot
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_3openalex-snapshot
A New Elimination Rule for the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/978-3-642-17685-2_10openalex-snapshot
Embedding a Proof System in Haskell
inferred← citeshttps://doi.org/10.1007/978-3-642-17796-5_10openalex-snapshot
Program Calculation in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-24452-0_6openalex-snapshot
Descriptor-Free Representation of Arrays with Dependent Types
inferred← citeshttps://doi.org/10.1007/978-3-642-31113-0_12openalex-snapshot
Dependently Typed Programming Based on Automated Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-32202-0openalex-snapshot
Generic and Indexed Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-36089-3_14openalex-snapshot
Layout-Sensitive Generalized Parsing
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.021openalex-snapshot
Web Interfaces for Proof Assistants
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.040openalex-snapshot
Type-level Computation Using Narrowing in Ωmega
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.08.016openalex-snapshot
Extracting a DPLL Algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.06.002openalex-snapshot
Containers: Constructing strictly positive types
inferred← citeshttps://doi.org/10.1017/s0956796816000174openalex-snapshot
Eliminating dependent pattern matching without K
inferred← citeshttps://doi.org/10.1017/s0956796820000064openalex-snapshot
Heterogeneous binary random-access lists
inferred← citeshttps://doi.org/10.1017/s0956796823000084openalex-snapshot
A correct-by-construction conversion from lambda calculus to combinatory logic
inferred← citeshttps://doi.org/10.1017/s0960129514000115openalex-snapshot
Partiality and recursion in interactive theorem provers – an overview
inferred← citeshttps://doi.org/10.1145/1173706.1173724openalex-snapshot
A verified staged interpreter is a verified compiler
inferred← citeshttps://doi.org/10.1145/1328438.1328475openalex-snapshot
Foundations for structured programming with GADTs
inferred← citeshttps://doi.org/10.1145/1328897.1328475openalex-snapshot
Foundations for structured programming with GADTs
inferred← citeshttps://doi.org/10.1145/1882362.1882432openalex-snapshot
Language-based verification will change the world
inferred← citeshttps://doi.org/10.1145/2036918.2036927openalex-snapshot
A foundation for GADTs and inductive families
inferred← citeshttps://doi.org/10.1145/2500365.2500595openalex-snapshot
Optimising purely functional GPU programs
inferred← citeshttps://doi.org/10.1145/2502409.2502413openalex-snapshot
Relational algebraic ornaments
inferred← citeshttps://doi.org/10.1145/2633628.2633630openalex-snapshot
Generic constructors and eliminators from descriptions
inferred← citeshttps://doi.org/10.1145/2676726.2677000openalex-snapshot
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
inferred← citeshttps://doi.org/10.1145/2775051.2677000openalex-snapshot
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy
inferred← citeshttps://doi.org/10.1145/2786536.2786538openalex-snapshot
Imperative objects with dependent types
inferred← citeshttps://doi.org/10.1145/2951913.2951917openalex-snapshot
Unifiers as equivalences: proof-relevant unification of dependently typed data
inferred← citeshttps://doi.org/10.1145/3022670.2951917openalex-snapshot
Unifiers as equivalences: proof-relevant unification of dependently typed data
inferred← citeshttps://doi.org/10.1145/3122975.3122976openalex-snapshot
Type-directed diffing of structured data
inferred← citeshttps://doi.org/10.1145/3293880.3294095openalex-snapshot
Eliminating Reflection from Type Theory: To the Legacy of Martin Hofmann
inferred← citeshttps://doi.org/10.1145/3331553.3342614openalex-snapshot
Position-dependent arrays and their application for high performance code generation
inferred← citeshttps://doi.org/10.1145/3471873.3472977openalex-snapshot
Generating high performance code for irregular data structures using dependent types
inferred← citeshttps://doi.org/10.1145/3527329openalex-snapshot
Language-parametric static semantic code completion
inferred← citeshttps://doi.org/10.1145/3652561.3652565openalex-snapshot
ExEl: Building an Elaborator Using Extensible Constraints
inferred← citeshttps://doi.org/10.15476/elte.2017.042openalex-snapshot
Programhelyesség-bizonyítás fordítási időben
inferred← citeshttps://doi.org/10.17760/d20383647openalex-snapshot
Typed programming language : the semantics of rank polymorphism
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:4)2011openalex-snapshot
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
inferred← citeshttps://doi.org/10.22152/programming-journal.org/2021/5/7openalex-snapshot
Programming Metamorphic Algorithms: An Experiment in Type-Driven Algorithm Design
inferred← citeshttps://doi.org/10.3233/fi-2010-304openalex-snapshot
A Tutorial Implementation of a Dependently Typed Lambda Calculus
inferred← citeshttps://doi.org/10.33540/237openalex-snapshot
Type-Safe Generic Differencing of Mutually Recursive Families
inferred← citeshttps://doi.org/10.4204/eptcs.185.5openalex-snapshot
Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study
inferred← citeshttps://doi.org/10.4204/eptcs.274.1openalex-snapshot
The RedPRL Proof Assistant (Invited Paper)
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3833openalex-snapshot
Dependently Typed Programming based on Automated Theorem Proving
inferred← citeshttps://doi.org/10.48550/arxiv.1703.05215openalex-snapshot
Algebraic Foundations of Proof Refinement
inferred← citeshttps://doi.org/10.70675/0fbba6fbz729az49fdzbf9azfc9f951aa0b0openalex-snapshot
Extraction de code fonctionnel certifié à partir de spécifications inductives
inferred← citeshttps://doi.org/10.70675/14b92255zafc9z4dcczb918z9b027d3ef2dfopenalex-snapshot
A formal framework for heterogeneous systems semantics
inferred← citeshttps://doi.org/10.70675/1aceeb9azede6z4f94z9967z189737f4f5a5openalex-snapshot
Size-based termination : semantics and generalizations
inferred← citeshttps://doi.org/10.70675/f3c96514z4373z4f99z8b3fzb1b41307d558openalex-snapshot
Formalisation et Méta-Théorie de la Théorie des Types
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.