Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Urabe, Natsuki
Hara, Masaki
and
Hasuo, Ichiro
2017.
Categorical liveness checking by corecursive algebras.
p.
1.
Abel, Andreas
Vezzosi, Andrea
and
Winterhalter, Theo
2017.
Normalization by evaluation for sized dependent types.
Proceedings of the ACM on Programming Languages,
Vol. 1,
Issue. ICFP,
p.
1.
Bahr, Patrick
Grathwohl, Hans Bugge
and
Mogelberg, Rasmus Ejlers
2017.
The clocks are ticking: No more delays!.
p.
1.
Avanzini, Martin
and
Dal Lago, Ugo
2017.
Automated Sized-Type Inference and Complexity Analysis.
Electronic Proceedings in Theoretical Computer Science,
Vol. 248,
Issue. ,
p.
7.
Blanchette, Jasmin Christian
Bouzy, Aymeric
Lochbihler, Andreas
Popescu, Andrei
and
Traytel, Dmitriy
2017.
Programming Languages and Systems.
Vol. 10201,
Issue. ,
p.
111.
Avanzini, Martin
and
Dal Lago, Ugo
2017.
Automating sized-type inference for complexity analysis.
Proceedings of the ACM on Programming Languages,
Vol. 1,
Issue. ICFP,
p.
1.
Abel, Andreas
Öhman, Joakim
and
Vezzosi, Andrea
2018.
Decidability of conversion for type theory in type theory.
Proceedings of the ACM on Programming Languages,
Vol. 2,
Issue. POPL,
p.
1.
Einarsdóttir, Sólrún Halla
Johansson, Moa
and
Åman Pohjola, Johannes
2018.
Artificial Intelligence and Symbolic Computation.
Vol. 11110,
Issue. ,
p.
70.
Demangeon, Romain
and
Yoshida, Nobuko
2018.
Causal Computational Complexity of Distributed Processes.
p.
344.
Danielsson, Nils Anders
2018.
Up-to techniques using sized types.
Proceedings of the ACM on Programming Languages,
Vol. 2,
Issue. POPL,
p.
1.
MOMIGLIANO, ALBERTO
PIENTKA, BRIGITTE
and
THIBODEAU, DAVID
2019.
A case study in programming coinductive proofs: Howe’s method.
Mathematical Structures in Computer Science,
Vol. 29,
Issue. 8,
p.
1309.
Sozeau, Matthieu
and
Mangin, Cyprien
2019.
Equations reloaded: high-level dependently-typed functional programming and proving in Coq.
Proceedings of the ACM on Programming Languages,
Vol. 3,
Issue. ICFP,
p.
1.
Cohen, Liron
and
Rowe, Reuben N. S.
2020.
Automated Reasoning.
Vol. 12166,
Issue. ,
p.
375.
Fiore, Marcelo P.
Pitts, Andrew M.
and
Steenkamp, S. C.
2020.
Foundations of Software Science and Computation Structures.
Vol. 12077,
Issue. ,
p.
257.
Cohen, Liron
2021.
Automated Deduction – CADE 28.
Vol. 12699,
Issue. ,
p.
3.
Jaber, Guilhem
and
Riba, Colin
2021.
Programming Languages and Systems.
Vol. 12648,
Issue. ,
p.
548.
Rusu, Vlad
and
Nowak, David
2021.
(Co)inductive proof systems for compositional proofs in reachability logic.
Journal of Logical and Algebraic Methods in Programming,
Vol. 118,
Issue. ,
p.
100619.
Pitts, Andrew M.
and
Steenkamp, S. C.
2022.
Constructing Initial Algebras Using Inflationary Iteration.
Electronic Proceedings in Theoretical Computer Science,
Vol. 372,
Issue. ,
p.
88.
Zúñiga, Angel
and
Bel-Enguix, Gemma
2022.
On Coevaluation Behavior and Equivalence.
Mathematics,
Vol. 10,
Issue. 20,
p.
3800.
Baelde, David
Doumane, Amina
Kuperberg, Denis
and
Saurin, Alexis
2022.
Bouncing Threads for Circular and Non-Wellfounded Proofs.
p.
1.
Discussions
No Discussions have been published for this article.