On the public citation graph

A cost-aware logical framework

0 signed · 79 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-46425-5_11openalex-snapshot
A Type System for Bounded Space and Functional In-Place Update—Extended Abstract
inferredcites →https://doi.org/10.1007/978-3-030-00704-1openalex-snapshot
Temporal Type Theory
inferredcites →https://doi.org/10.1007/978-3-030-17184-1_1openalex-snapshot
Time Credits and Time Receipts in Iris
inferredcites →https://doi.org/10.1007/978-3-031-26212-8_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-04652-0_5openalex-snapshot
Dependently Typed Programming in Agda
inferredcites →https://doi.org/10.1007/978-3-642-11957-6_6openalex-snapshot
Amortised Resource Analysis with Separation Logic
inferredcites →https://doi.org/10.1007/978-3-662-49630-5_2openalex-snapshot
Guarded Dependent Type Theory with Coinductive Types
inferredcites →https://doi.org/10.1007/s10990-006-0480-6openalex-snapshot
Call-by-push-value: Decomposing call-by-value and call-by-name
inferredcites →https://doi.org/10.1016/0020-0190(81)90030-2openalex-snapshot
Real-time queue operations in pure LISP
inferredcites →https://doi.org/10.1016/0020-0190(82)90015-1openalex-snapshot
An efficient functional implementation of FIFO queues
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/j.entcs.2015.12.020openalex-snapshot
A Model of PCF in Guarded Type Theory
inferredcites →https://doi.org/10.1016/j.tcs.2019.01.015openalex-snapshot
Canonicity and normalization for dependent type theory
inferredcites →https://doi.org/10.1017/9781108854429.007openalex-snapshot
Topo-logie
inferredcites →https://doi.org/10.1017/9781316755983.009openalex-snapshot
Computational complexity and induction for partial computable functions in type theory
inferredcites →https://doi.org/10.1017/cbo9780511530104openalex-snapshot
Purely Functional Data Structures
inferredcites →https://doi.org/10.1017/s095679681300018xopenalex-snapshot
Idris, a general-purpose dependently typed programming language: Design and implementation
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1017/s0960129505004822openalex-snapshot
Modelling general recursion in type theory
inferredcites →https://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
inferredcites →https://doi.org/10.1109/lics.2011.16openalex-snapshot
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees
inferredcites →https://doi.org/10.1109/lics.2017.8005089openalex-snapshot
Dual-Context Calculi for Modal Logic
inferredcites →https://doi.org/10.1109/lics52264.2021.9470719openalex-snapshot
Normalization for Cubical Type Theory
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
inferredcites →https://doi.org/10.1145/1190216.1190245openalex-snapshot
Towards a mechanized metatheory of standard ML
inferredcites →https://doi.org/10.1145/1328438.1328457openalex-snapshot
Lightweight semiformal time complexity analysis for purely functional data structures
inferredcites →https://doi.org/10.1145/1411204.1411240openalex-snapshot
Space profiling for parallel functional programs
inferredcites →https://doi.org/10.1145/1706299.1706327openalex-snapshot
Static determination of quantitative resource usage for higher-order programs
inferredcites →https://doi.org/10.1145/224164.224210openalex-snapshot
Parallelism in sequential functional languages
inferredcites →https://doi.org/10.1145/232627.232650openalex-snapshot
A provable time and space efficient implementation of NESL
inferredcites →https://doi.org/10.1145/2676726.2676980openalex-snapshot
Iris
inferredcites →https://doi.org/10.1145/2784731.2784749openalex-snapshot
Denotational cost semantics for functional languages with inductive types
inferredcites →https://doi.org/10.1145/2837614.2837638openalex-snapshot
Type theory in type theory using quotient inductive types
inferredcites →https://doi.org/10.1145/2841316openalex-snapshot
Verified Functional Programming in Agda
inferredcites →https://doi.org/10.1145/3133903openalex-snapshot
TiML: a functional language for practical complexity analysis with invariants
inferredcites →https://doi.org/10.1145/316686.316690openalex-snapshot
A provably time-efficient parallel implementation of full speculation
inferredcites →https://doi.org/10.1145/3209108.3209146openalex-snapshot
Work Analysis with Resource-Aware Session Types
inferredcites →https://doi.org/10.1145/3236786openalex-snapshot
Parallel complexity analysis with temporal session types
inferredcites →https://doi.org/10.1145/325694.325716openalex-snapshot
Resource bound certification
inferredcites →https://doi.org/10.1145/3371083openalex-snapshot
Recurrence extraction for functional programs through call-by-push-value
inferredcites →https://doi.org/10.1145/3371092openalex-snapshot
Liquidate your assets: reasoning about resource usage in liquid Haskell
inferredcites →https://doi.org/10.1145/3371126openalex-snapshot
The fire triangle: how to mix substitution, dependent elimination, and effects
inferredcites →https://doi.org/10.1145/3372885.3373826openalex-snapshot
A formal proof of the independence of the continuum hypothesis
inferredcites →https://doi.org/10.1145/3372885.3373830openalex-snapshot
Formalising perfectoid spaces
inferredcites →https://doi.org/10.1145/3434308openalex-snapshot
A unifying type-theory for higher-order (amortized) cost analysis
inferredcites →https://doi.org/10.1145/3462303openalex-snapshot
agda-calf
inferredcites →https://doi.org/10.1145/3474834openalex-snapshot
Logical Relations as Types: Proof-Relevant Parametricity for Program Modules
inferredcites →https://doi.org/10.1145/357233.357238openalex-snapshot
The Type Theory of PL/CV3
inferredcites →https://doi.org/10.1145/382780.382785openalex-snapshot
A modal analysis of staged computation
inferredcites →https://doi.org/10.1145/604131.604148openalex-snapshot
Static prediction of heap space usage for first-order functional programs
inferredcites →https://doi.org/10.1145/96709.96744openalex-snapshot
Higher-order modules and the phase distinction
inferredcites →https://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types
inferredcites →https://doi.org/10.23638/lmcs-16(1:2)2020openalex-snapshot
Modalities in homotopy type theory
inferredcites →https://doi.org/10.4230/lipics.fscd.2016.6openalex-snapshot
Normalisation by Evaluation for Dependent Types
inferredcites →https://doi.org/10.46298/lmcs-18(2:15)2022openalex-snapshot
Quotients, inductive types, and quotient inductive types
inferredcites →https://doi.org/10.7551/mitpress/9153.001.0001openalex-snapshot
Certified Programming with Dependent Types

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_15openalex-snapshot
A Category-Theoretic Framework for Dependent Effect Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_17openalex-snapshot
The Memorist Tale: Every Thunk Every Cost All At Once
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_13openalex-snapshot
Dependently-Typed AARA: A Non-Affine Approach for Resource Analysis of Higher-Order Programs
inferred← citeshttps://doi.org/10.1109/etcom66606.2025.11436244openalex-snapshot
Reliability Engineering Metrics in Continuous Deployment
inferred← citeshttps://doi.org/10.1109/icces67310.2025.11336325openalex-snapshot
Energy-Efficient Resource Scaling in DevOps Continuous Testing Environments
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175720openalex-snapshot
Automatic Amortized Resource Analysis with Regular Recursive Types
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175777openalex-snapshot
A Metalanguage for Cost-Aware Denotational Semantics
inferred← citeshttps://doi.org/10.1145/3632852openalex-snapshot
Decalf: A Directed, Effectful Cost-Aware Logical Framework
inferred← citeshttps://doi.org/10.1145/3632918openalex-snapshot
Polynomial Time and Dependent Types
inferred← citeshttps://doi.org/10.1145/3656380openalex-snapshot
Robust Resource Bounds with Static Analysis and Bayesian Inference
inferred← citeshttps://doi.org/10.1145/3674626openalex-snapshot
Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs
inferred← citeshttps://doi.org/10.1145/3720424openalex-snapshot
Denotational Foundations for Expected Cost Analysis
inferred← citeshttps://doi.org/10.1145/3720492openalex-snapshot
Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials
inferred← citeshttps://doi.org/10.1145/3763798openalex-snapshot
Integrating Resource Analyses via Resource Decomposition
inferred← citeshttps://doi.org/10.1145/3776678openalex-snapshot
Handling Higher-Order Effectful Operations with Judgemental Monadic Laws
inferred← citeshttps://doi.org/10.1145/3776699openalex-snapshot
Domain-Theoretic Semantics for Functional Logic Programming
inferred← citeshttps://doi.org/10.1145/3779031.3779085openalex-snapshot
Mechanizing Synthetic Tait Computability in Istari
inferred← citeshttps://doi.org/10.1145/3828674openalex-snapshot
Adequacy for Predicate Transformer Semantics
inferred← citeshttps://doi.org/10.46298/entics.14732openalex-snapshot
Cost-sensitive computational adequacy of higher-order recursion in synthetic domain theory
inferred← citeshttps://doi.org/10.46298/entics.14797openalex-snapshot
Amortized Analysis via Coalgebra
inferred← citeshttps://doi.org/10.47467/elmal.v5i11.3998openalex-snapshot
Pola Penerapan Implementasi Teknologi Tepat Guna Berbasis Machine Learning dalam Identifikasi Keramik sebagai Infrastruktur Wisata Edukasi di Desa Pagelaran
inferred← citeshttps://doi.org/10.47467/elmal.v5i11.4001openalex-snapshot
Inovasi Kuliner Ramah Anak di Desa Banjarsari Melalui Pengembangan Produk Tape Mochi Layak Hilirisasi
inferred← citeshttps://doi.org/10.48550/arxiv.2307.05938openalex-snapshot
Decalf: A Directed, Effectful Cost-Aware Logical Framework
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.