Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Barthe, Gilles
and
Coquand, Thierry
2002.
Applied Semantics.
Vol. 2395,
Issue. ,
p.
1.
Abel, Andreas
2003.
Typed Lambda Calculi and Applications.
Vol. 2701,
Issue. ,
p.
1.
Abel, Andreas
2004.
Termination checking with types.
RAIRO - Theoretical Informatics and Applications,
Vol. 38,
Issue. 4,
p.
277.
Pientka, Brigitte
2005.
Verifying Termination and Reduction Properties about Higher-Order Logic Programs.
Journal of Automated Reasoning,
Vol. 34,
Issue. 2,
p.
179.
Bulwahn, Lukas
Krauss, Alexander
and
Nipkow, Tobias
2007.
Theorem Proving in Higher Order Logics.
Vol. 4732,
Issue. ,
p.
38.
Danielsson, Nils Anders
2007.
Types for Proofs and Programs.
Vol. 4502,
Issue. ,
p.
93.
Owens, Scott
and
Slind, Konrad
2008.
Adapting functional programs to higher order logic.
Higher-Order and Symbolic Computation,
Vol. 21,
Issue. 4,
p.
377.
Moyen, Jean-Yves
2009.
Resource control graphs.
ACM Transactions on Computational Logic,
Vol. 10,
Issue. 4,
p.
1.
Keller, Chantal
and
Altenkirch, Thorsten
2010.
Hereditary substitutions for simple types, formalized.
p.
3.
Danielsson, Nils Anders
and
Altenkirch, Thorsten
2010.
Mathematics of Program Construction.
Vol. 6120,
Issue. ,
p.
100.
Hinze, Ralf
and
James, Daniel W.H.
2011.
Proving the unique fixed-point principle correct.
ACM SIGPLAN Notices,
Vol. 46,
Issue. 9,
p.
359.
Hinze, Ralf
and
James, Daniel W.H.
2011.
Proving the unique fixed-point principle correct.
p.
359.
McBride, Conor Thomas
2012.
Agda-curious?.
ACM SIGPLAN Notices,
Vol. 47,
Issue. 9,
p.
1.
Abel, Andreas
2012.
Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types.
Electronic Proceedings in Theoretical Computer Science,
Vol. 77,
Issue. ,
p.
1.
McBride, Conor Thomas
2012.
Agda-curious?.
p.
1.
Abel, Andreas
and
Chapman, James
2014.
Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types.
Electronic Proceedings in Theoretical Computer Science,
Vol. 153,
Issue. ,
p.
51.
Grechanik, S. A.
2015.
Proving properties of functional programs by equality saturation.
Programming and Computer Software,
Vol. 41,
Issue. 3,
p.
149.
Grechanik, Sergei
2015.
Perspectives of System Informatics.
Vol. 8974,
Issue. ,
p.
127.
BOVE, ANA
KRAUSS, ALEXANDER
and
SOZEAU, MATTHIEU
2016.
Partiality and recursion in interactive theorem provers – an overview.
Mathematical Structures in Computer Science,
Vol. 26,
Issue. 1,
p.
38.
Abel, Andreas
2016.
Coalgebraic Methods in Computer Science.
Vol. 9608,
Issue. ,
p.
5.
Discussions
No Discussions have been published for this article.