Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Blanqui, Frédéric
2005.
Computer Science Logic.
Vol. 3634,
Issue. ,
p.
135.
Barthe, Gilles
Grégoire, Benjamin
and
Pastawski, Fernando
2005.
Typed Lambda Calculi and Applications.
Vol. 3461,
Issue. ,
p.
71.
Abel, Andreas
2006.
Computer Science Logic.
Vol. 4207,
Issue. ,
p.
72.
Giesl, Jürgen
Swiderski, Stephan
Schneider-Kamp, Peter
and
Thiemann, René
2006.
Term Rewriting and Applications.
Vol. 4098,
Issue. ,
p.
297.
Abel, Andreas
2006.
Mathematics of Program Construction.
Vol. 4014,
Issue. ,
p.
10.
Barthe, Gilles
Grégoire, Benjamin
and
Pastawski, Fernando
2006.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 4246,
Issue. ,
p.
257.
(INRIA), Frédéric Blanqui
and
(INPL), Colin Riba
2006.
Logic for Programming, Artificial Intelligence, and Reasoning.
Vol. 4246,
Issue. ,
p.
105.
Jones, Neil D.
and
Andersen, Nils
2007.
Flow analysis of lazy higher-order functional programs.
Theoretical Computer Science,
Vol. 375,
Issue. 1-3,
p.
120.
Riba, Colin
2007.
Foundations of Software Science and Computational Structures.
Vol. 4423,
Issue. ,
p.
317.
Blanqui, Frédéric
Jouannaud, Jean-Pierre
and
Rubio, Albert
2008.
Computer Science Logic.
Vol. 5213,
Issue. ,
p.
1.
Riba, Colin
2008.
Logic and Theory of Algorithms.
Vol. 5028,
Issue. ,
p.
498.
Asperti, A.
Ricciotti, W.
Sacerdoti Coen, C.
and
Tassi, E.
2009.
A compact kernel for the calculus of inductive constructions.
Sadhana,
Vol. 34,
Issue. 1,
p.
71.
Barthe, Gilles
Grégoire, Benjamin
and
Riba, Colin
2009.
Language Engineering and Rigorous Software Development.
Vol. 5520,
Issue. ,
p.
100.
Dunfield, Jana
2009.
Greedy bidirectional polymorphism.
p.
15.
ABEL, ANDREAS
2009.
Implementing a normalizer using sized heterogeneous types.
Journal of Functional Programming,
Vol. 19,
Issue. 3-4,
p.
287.
Lämmel, Ralf
Thompson, Simon
and
Kaiser, Markus
2009.
Programming Errors in Traversal Programs Over Structured Data.
Electronic Notes in Theoretical Computer Science,
Vol. 238,
Issue. 5,
p.
135.
Giesl, Jürgen
Raffelsieper, Matthias
Schneider-Kamp, Peter
Swiderski, Stephan
and
Thiemann, René
2011.
Automated termination proofs for haskell by term rewriting.
ACM Transactions on Programming Languages and Systems,
Vol. 33,
Issue. 2,
p.
1.
Uustalu, Tarmo
and
Vene, Varmo
2011.
The Recursion Scheme from the Cofree Recursive Comonad.
Electronic Notes in Theoretical Computer Science,
Vol. 229,
Issue. 5,
p.
135.
Dunfield, Jana
and
Krishnaswami, Neelakantan R.
2013.
Complete and easy bidirectional typechecking for higher-rank polymorphism.
ACM SIGPLAN Notices,
Vol. 48,
Issue. 9,
p.
429.
Dunfield, Jana
and
Krishnaswami, Neelakantan R.
2013.
Complete and easy bidirectional typechecking for higher-rank polymorphism.
p.
429.