Termination checking with types
RAIRO-Theor. Inf. Appl., 38 4 (2004) 277-319
Published online: 2004-10-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Probabilistic Termination by Monadic Affine Sized Typing
Ugo Dal Lago and Charles GrelloisACM Transactions on Programming Languages and Systems 41 (2) 1 (2019)
https://doi.org/10.1145/3293605
Programming Languages and Systems
Ningning Xie and Bruno C. d. S. OliveiraLecture Notes in Computer Science, Programming Languages and Systems 10801 272 (2018)
https://doi.org/10.1007/978-3-319-89884-1_10
Size-based termination of higher-order rewriting
FRÉDÉRIC BLANQUIJournal of Functional Programming 28 (2018)
https://doi.org/10.1017/S0956796818000072
43 (2017)
https://doi.org/10.1145/3088525.3088673
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility
Frédéric BlanquiTheoretical Computer Science 611 50 (2016)
https://doi.org/10.1016/j.tcs.2015.07.045
1 (2016)
https://doi.org/10.1145/2966268.2966269
192 (2015)
https://doi.org/10.1145/2784731.2784732
Foundational extensible corecursion: a proof assistant perspective
Jasmin Christian Blanchette, Andrei Popescu and Dmitriy TraytelACM SIGPLAN Notices 50 (9) 192 (2015)
https://doi.org/10.1145/2858949.2784732
429 (2013)
https://doi.org/10.1145/2500365.2500582
Complete and easy bidirectional typechecking for higher-rank polymorphism
Jana Dunfield and Neelakantan R. KrishnaswamiACM SIGPLAN Notices 48 (9) 429 (2013)
https://doi.org/10.1145/2544174.2500582
Automated termination proofs for haskell by term rewriting
Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski and René ThiemannACM Transactions on Programming Languages and Systems 33 (2) 1 (2011)
https://doi.org/10.1145/1890028.1890030
The Recursion Scheme from the Cofree Recursive Comonad
Tarmo Uustalu and Varmo VeneElectronic Notes in Theoretical Computer Science 229 (5) 135 (2011)
https://doi.org/10.1016/j.entcs.2011.02.020
Language Engineering and Rigorous Software Development
Gilles Barthe, Benjamin Grégoire and Colin RibaLecture Notes in Computer Science, Language Engineering and Rigorous Software Development 5520 100 (2009)
https://doi.org/10.1007/978-3-642-03153-3_3
Implementing a normalizer using sized heterogeneous types
ANDREAS ABELJournal of Functional Programming 19 (3-4) 287 (2009)
https://doi.org/10.1017/S0956796809007266
Programming Errors in Traversal Programs Over Structured Data
Ralf Lämmel, Simon Thompson and Markus KaiserElectronic Notes in Theoretical Computer Science 238 (5) 135 (2009)
https://doi.org/10.1016/j.entcs.2009.09.045
A compact kernel for the calculus of inductive constructions
A. Asperti, W. Ricciotti, C. Sacerdoti Coen and E. TassiSadhana 34 (1) 71 (2009)
https://doi.org/10.1007/s12046-009-0003-3
15 (2009)
https://doi.org/10.1145/1596627.1596631
5213 1 (2008)
https://doi.org/10.1007/978-3-540-87531-4_1
Logic and Theory of Algorithms
Colin RibaLecture Notes in Computer Science, Logic and Theory of Algorithms 5028 498 (2008)
https://doi.org/10.1007/978-3-540-69407-6_54
Foundations of Software Science and Computational Structures
Colin RibaLecture Notes in Computer Science, Foundations of Software Science and Computational Structures 4423 317 (2007)
https://doi.org/10.1007/978-3-540-71389-0_23
Flow analysis of lazy higher-order functional programs
Neil D. Jones and Nils AndersenTheoretical Computer Science 375 (1-3) 120 (2007)
https://doi.org/10.1016/j.tcs.2006.12.030
Term Rewriting and Applications
Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp and René ThiemannLecture Notes in Computer Science, Term Rewriting and Applications 4098 297 (2006)
https://doi.org/10.1007/11805618_23
Computer Science Logic
Andreas AbelLecture Notes in Computer Science, Computer Science Logic 4207 72 (2006)
https://doi.org/10.1007/11874683_5
Mathematics of Program Construction
Andreas AbelLecture Notes in Computer Science, Mathematics of Program Construction 4014 10 (2006)
https://doi.org/10.1007/11783596_4
Logic for Programming, Artificial Intelligence, and Reasoning
Gilles Barthe, Benjamin Grégoire and Fernando PastawskiLecture Notes in Computer Science, Logic for Programming, Artificial Intelligence, and Reasoning 4246 257 (2006)
https://doi.org/10.1007/11916277_18
Logic for Programming, Artificial Intelligence, and Reasoning
Frédéric Blanqui (INRIA) and Colin Riba (INPL)Lecture Notes in Computer Science, Logic for Programming, Artificial Intelligence, and Reasoning 4246 105 (2006)
https://doi.org/10.1007/11916277_8
Computer Science Logic
Frédéric BlanquiLecture Notes in Computer Science, Computer Science Logic 3634 135 (2005)
https://doi.org/10.1007/11538363_11
Typed Lambda Calculi and Applications
Gilles Barthe, Benjamin Grégoire and Fernando PastawskiLecture Notes in Computer Science, Typed Lambda Calculi and Applications 3461 71 (2005)
https://doi.org/10.1007/11417170_7