On the public citation graph

Practical Inference for Type-Based Termination in a Polymorphic Setting

https://doi.org/10.1007/11417170_7
0 signed · 34 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-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/978-3-540-24727-2_2openalex-snapshot
Theories for the Global Ubiquitous Computer
inferredcites →https://doi.org/10.1007/978-3-540-25979-4_2openalex-snapshot
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
inferredcites →https://doi.org/10.1007/bfb0053541openalex-snapshot
Analysis of a guard condition in type theory
inferredcites →https://doi.org/10.1007/bfb0055070openalex-snapshot
Structural recursive definitions in type theory
inferredcites →https://doi.org/10.1016/0168-0072(91)90069-xopenalex-snapshot
Inductive types and type constraints in the second-order lambda calculus
inferredcites →https://doi.org/10.1017/s0960129503004122openalex-snapshot
Type-based termination of recursive definitions
inferredcites →https://doi.org/10.1023/a:1012996816178openalex-snapshot
Calculating Sized Types
inferredcites →https://doi.org/10.1023/a:1019916231463openalex-snapshot
Dependent Types for Program Termination Verification
inferredcites →https://doi.org/10.1051/ita:2004015openalex-snapshot
Termination checking with types
inferredcites →https://doi.org/10.1145/237721.240882openalex-snapshot
Proving the correctness of reactive systems using sized types
inferredcites →https://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11538363_11openalex-snapshot
Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
inferred← citeshttps://doi.org/10.1007/11783596_4openalex-snapshot
Towards Generic Programming with Sized Types
inferred← citeshttps://doi.org/10.1007/11874683_5openalex-snapshot
Semi-continuous Sized Types and Termination
inferred← citeshttps://doi.org/10.1007/11916277_18openalex-snapshot
CIC $\widehat{~}$ : Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1007/11916277_8openalex-snapshot
Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_11openalex-snapshot
Linear Sized Types in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_35openalex-snapshot
Type-Based Termination with Sized Products
inferred← citeshttps://doi.org/10.1007/978-3-642-03153-3_3openalex-snapshot
A Tutorial on Type-Based Termination
inferred← citeshttps://doi.org/10.1016/j.scico.2008.01.004openalex-snapshot
Type-based termination of generic programs
inferred← citeshttps://doi.org/10.1017/s0956796809007266openalex-snapshot
Implementing a normalizer using sized heterogeneous types
inferred← citeshttps://doi.org/10.1017/s0956796816000022openalex-snapshot
Well-founded recursion with copatterns and sized types
inferred← citeshttps://doi.org/10.1017/s0956796816000319openalex-snapshot
Interactive programming in Agda – Objects and graphical user interfaces
inferred← citeshttps://doi.org/10.1017/s0956796818000072openalex-snapshot
Size-based termination of higher-order rewriting
inferred← citeshttps://doi.org/10.1017/s0956796822000120openalex-snapshot
Is sized typing for Coq practical?
inferred← citeshttps://doi.org/10.1109/lics.2013.29openalex-snapshot
Type-Based Productivity of Stream Definitions in the Calculus of Constructions
inferred← citeshttps://doi.org/10.14236/ewic/msfp2006.3openalex-snapshot
Implementing a Normalizer Using Sized Heterogeneous Types
inferred← citeshttps://doi.org/10.14288/1.0406074openalex-snapshot
Practical Sized Typing for Coq
inferred← citeshttps://doi.org/10.2168/lmcs-1(2:1)2005openalex-snapshot
General Recursion via Coinductive Types
inferred← citeshttps://doi.org/10.2168/lmcs-4(2:3)2008openalex-snapshot
Semi-continuous Sized Types and Termination
inferred← citeshttps://doi.org/10.26083/tuprints-00001865openalex-snapshot
Verification of Second-Order Functional Programs
inferred← citeshttps://doi.org/10.70675/1aceeb9azede6z4f94z9967z189737f4f5a5openalex-snapshot
Size-based termination : semantics and generalizations
inferred← citeshttps://doi.org/10.70675/528a189dz6263z4b1dz95bdz158fff7ad77eopenalex-snapshot
Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typage
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.