Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Hongwei Xi
2001.
Dependent types for program termination verification.
p.
231.
Danvy, Olivier
and
Nielsen, Lasse R.
2001.
Defunctionalization at work.
p.
162.
Rhiger, Morten
2002.
Practical Aspects of Declarative Languages.
Vol. 2257,
Issue. ,
p.
120.
Tabuchi, Naoshi
Sumii, Eijiro
and
Yonezawa, Akinori
2003.
Regular Expression Types for Strings in a Text Processing Language.
Electronic Notes in Theoretical Computer Science,
Vol. 75,
Issue. ,
p.
95.
Frisch, Alain
and
Cardelli, Luca
2004.
Automata, Languages and Programming.
Vol. 3142,
Issue. ,
p.
618.
Dennis, Louise A.
2007.
Enhancing Theorem Prover Interfaces with Program Slice Information.
Electronic Notes in Theoretical Computer Science,
Vol. 174,
Issue. 2,
p.
19.
Fitzgerald, John
and
Larsen, Peter Gorm
2007.
Formal Methods and Hybrid Real-Time Systems.
Vol. 4700,
Issue. ,
p.
237.
Owens, Scott
and
Slind, Konrad
2008.
Adapting functional programs to higher order logic.
Higher-Order and Symbolic Computation,
Vol. 21,
Issue. 4,
p.
377.
Harper, Robert
2009.
FUNCTIONAL PEARL. Proof-directed debugging – Corrigendum.
Journal of Functional Programming,
Vol. 19,
Issue. 2,
p.
262.
Danvy, Olivier
and
Millikin, Kevin
2009.
Refunctionalization at work.
Science of Computer Programming,
Vol. 74,
Issue. 8,
p.
534.
Kirrage, James
Rathnayake, Asiri
and
Thielecke, Hayo
2013.
Network and System Security.
Vol. 7873,
Issue. ,
p.
135.
Wu, Chunhan
Zhang, Xingyuan
and
Urban, Christian
2014.
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions.
Journal of Automated Reasoning,
Vol. 52,
Issue. 4,
p.
451.
Davies, Rowan
2017.
A Temporal Logic Approach to Binding-Time Analysis.
Journal of the ACM,
Vol. 64,
Issue. 1,
p.
1.
Stump, Aaron
Jenkins, Christopher
Spahn, Stephan
and
McDonald, Colin
2020.
Strong functional pearl: Harper’s regular-expression matcher in Cedille.
Proceedings of the ACM on Programming Languages,
Vol. 4,
Issue. ICFP,
p.
1.
FILINSKI, ANDRZEJ
2021.
Proof-directed program transformation: A functional account of efficient regular expression matching.
Journal of Functional Programming,
Vol. 31,
Issue. ,
Abreu, Pedro
Delaware, Benjamin
Hubers, Alex
Jenkins, Christa
Morris, J. Garrett
and
Stump, Aaron
2023.
A Type-Based Approach to Divide-and-Conquer Recursion in Coq.
Proceedings of the ACM on Programming Languages,
Vol. 7,
Issue. POPL,
p.
61.
Discussions
No Discussions have been published for this article.