Subtractive logicTristan Crolard · 2001

A type theory which is complete for Kreisel's modified realizabilityTristan Crolard · 1999

Extending the loop language with higher-order procedural variablesCrolard, Tristan; Polonowski, Emmanuel; Valarcher, Pierre · ACM Transactions on Computational Logic · 2009

[ACM Press the 19th Workshop - Barcelona, Spain (2017.06.18-2017.06.23)] Proceedings of the 19th Workshop on Formal Techniques for Java-like Programs - FTFJP'17 - A Coq-based synthesis of Scala programs which are correct-by-constructionEl Bakouny, Youssef; Crolard, Tristan; Mezher, Dani · 2017

[ACM Press the 2013 ACM SIGAda annual conference - Pittsburgh, Pennsylvania, USA (2013.11.10-2013.11.14)] Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology - HILT '13 - Towards the formalization of SPARK 2014 semantics with explicit run-time checks using coqCourtieu, Pierre; Aponte, Maria Virginia; Crolard, Tristan; Zhang, Zhi; Robby, Fnu; Belt, Jason; Hatcliff, John; Guitton, Jerome; Jennings, Trevor · 2013

Pure type systems with judgemental equalityADAMS, ROBIN · Journal of Functional Programming · 2005

FUNCTIONAL PEARL Unfolding pointer algorithmsBIRD, RICHARD S. · Journal of Functional Programming · 2001

Red-black trees with typesKAHRS, STEFAN · Journal of Functional Programming · 2001

Functional programming for business studentsMolyneux, Phil · Journal of Functional Programming · 1993

Metamorphism in jigsawNAKANO, KEISUKE · Journal of Functional Programming · 2013

Data types à la carteSWIERSTRA, WOUTER · Journal of Functional Programming · 2008

Delimited control and computational effectsDOWNEN, PAUL; ARIOLA, ZENA M. · Journal of Functional Programming · 2014

The view from the leftMCBRIDE, CONOR; MCKINNA, JAMES · Journal of Functional Programming · 2004