Arthur Charguéraud, Alan Schmitt, and Thomas Wood. JSExplain: A Double Debugger for JavaScript. In The Web Conference 2018, pages 1--9, Lyon, France, April 2018. [ bib | hal | .pdf ]

Sergueï Lenglet and Alan Schmitt. HOπ in Coq. In CPP 2018 - The 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, United States, January 2018. [ bib | http | .pdf ]

Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, and Alan Schmitt. Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pages 1--12. IEEE Computer Society, 2017. [ bib | hal | http | .pdf ]

Sergueï Lenglet and Alan Schmitt. Howe's Method for Contextual Semantics. In Proceedings of the 26th International Conference on Concurrency Theory (Concur 2015), September 2015. [ bib | hal ]

Petar Maksimović and Alan Schmitt. HOCore in Coq. In Christian Urban and Xingyuan Zhang, editors, Proceedings of the 6th conference on Interactive Theorem Proving (ITP 2015), volume 9236 of Lecture Notes in Computer Science, pages 278--293. Springer, August 2015. [ bib | hal ]

José Fragoso Santos, Thomas Jensen, Tamara Rezk, and Alan Schmitt. Hybrid Typing of Secure Information Flow in a JavaScript-like Language. In Proceedings of the 10th International Symposium on Trustworthy Global Computing (TGC 2015), August 2015. [ bib | hal ]

Pierre Genevès and Alan Schmitt. Expressive Logical Combinators For Free. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 311--317. AAAI Press, July 2015. [ bib | hal ]

Martin Bodin, Thomas Jensen, and Alan Schmitt. Certified Abstract Interpretation with Pretty-Big-Step Semantics. In Proceedings of the 2015 Conference on Certified Programs and Proofs, CPP 2015, pages 29--40. ACM, January 2015. [ bib | hal ]

Martin Bodin, Arthur Charguéraud, Daniele Filaretti, Philippa Gardner, Sergio Maffeis, Daiva Naudziuniene, Alan Schmitt, and Gareth Smith. A Trusted Mechanised JavaScript Specification. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2014), pages 87--100, San Diego, CA, USA, January 2014. [ bib | conference version ]

Ivan Lanese, Michaël Lienhardt, Claudio Antares Mezzina, Alan Schmitt, and Jean-Bernard Stefani. Concurrent Flexible Reversibility. In Proceedings of the 22nd European Symposium on Programming (ESOP 2013), volume 7792 of Lecture Notes in Computer Science, pages 370--390, March 2013. [ bib | conference version ]

Ivan Lanese, Claudio Antares Mezzina, Alan Schmitt, and Jean-Bernard Stefani. Controlling Reversibility in Higher-Order Pi. In Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR 2011), volume 6901 of Lecture Notes in Computer Science, pages 297--311, Aachen, Germany, September 2011. Springer. [ bib | conference version ]

Everardo Bárcenas, Pierre Genevès, Nabil Layaïda, and Alan Schmitt. Query Reasoning on Trees with Types, Interleaving, and Counting. In Toby Walsh, editor, Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI '11), pages 718--723, Barcelona, Spain, July 2011. AAAI Press/International Joint Conferences on Artificial Intelligence. [ bib | conference version ]

Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, and Alan Schmitt. On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi. In Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, editors, Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), volume 6199 of Lecture Notes in Computer Science, pages 442--453, Bordeaux, France, June 2010. Springer. [ bib | conference version ]

Sergueï Lenglet, Alan Schmitt, and Jean-Bernard Stefani. Howe's Method for Calculi with Passivation. In Mario Bravetti and Gianluigi Zavattaro, editors, Proceedings of the 20th International Conference on Concurrency Theory (CONCUR 2009), volume 5710 of Lecture Notes in Computer Science, pages 448--462, Bologna, Italy, September 2009. Springer. [ bib | conference version ]

Michaël Lienhardt, Claudio Antares Mezzina, Alan Schmitt, and Jean-Bernard Stefani. Typing Component-Based Communication Systems. In Proceedings of the 11th Formal Methods for Open Object-Based Distributed Systems (FMOODS) & 29th Formal Techniques for Networked and Distributed Systems (FORTE), volume 5522 of Lecture Notes in Computer Science, pages 167--181, Lisbon, Portugal, June 2009. Springer-Verlag. [ bib | conference version ]

Sergueï Lenglet, Alan Schmitt, and Jean-Bernard Stefani. Normal bisimulations in process calculi with passivation. In Luca de Alfaro, editor, Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures (FOSSACS 2009), volume 5504 of Lecture Notes in Computer Science, pages 257--271, York, United Kingdom, March 2009. Springer. [ bib | conference version ]

Michaël Lienhardt, Alan Schmitt, and Jean-Bernard Stefani. Typing Communicating Component Assemblages. In Proceedings of the 7th International Conference on Generative Programming and Component Engineering (GPCE'08), pages 125--136, Nashville, TN, USA, October 2008. ACM. [ bib | conference version ]

Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, and Alan Schmitt. On the Expressiveness and Decidability of Higher-Order Process Calculi. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), pages 145--155, Pittsburgh, Pennsylvania, USA, June 2008. [ bib | conference version | slides ]

Aaron Bohannon, J. Nathan Foster, Benjamin C. Pierce, Alexandre Pilkiewicz, and Alan Schmitt. Boomerang: Resourceful Lenses for String Data. In ACM SIGPLAN--SIGACT Symposium on Principles of Programming Languages (POPL'08), pages 407--419, San Francisco, California, USA, January 2008. ACM. [ bib | tech report | conference version | slides ]

Michaël Lienhardt, Jean-Bernard Stefani, and Alan Schmitt. Oz/K: A Kernel Language for Component-Based Open Programming. In ACM, editor, 6th International Conference on Generative Programming and Component Engineering (GPCE'07), pages 43--52, Salzburg, Austria, October 2007. [ bib | conference version ]

Pierre Genevès, Nabil Layaïda, and Alan Schmitt. Efficient Static Analysis of XML Paths and Types. In PLDI '07: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation, pages 342--351, New York, NY, USA, June 2007. ACM Press. [ bib | conference version ]

Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, and Alan Schmitt. Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data. In 20th International Symposium on Distributed Computing (DISC), volume 4167 of Lecture Notes in Computer Science, pages 269--283, Stockholm, Sweden, September 2006. [ bib | conference version | slides ]

Daniel Hirschkoff, Tom Hirschowitz, Damien Pous, Alan Schmitt, and Jean-Bernard Stefani. Component-Oriented Programming with Sharing: Containment is not Ownership. In 4th International Conference on Generative Programming and Component Engineering (GPCE), volume 3676 of Lecture Notes in Computer Science, pages 389--404, Tallinn, Estonia, September 2005. [ bib | conference version ]

J. Nathan Foster, Michael B. Greenwald, Christian Kirkegaard, Benjamin C. Pierce, and Alan Schmitt. Exploiting Schemas in Data Synchronization. In Database Programming Languages (DBPL), August 2005. [ bib | tech report | conference version ]

Philippe Bidinger, Alan Schmitt, and Jean-Bernard Stefani. An Abstract Machine for the Kell Calculus. In 7th IFIP International Conference on Formal Methods for Object-Based Distributed Systems (FMOODS), volume 3535 of Lecture Notes in Computer Science, pages 43--58, Athens, Greece, June 2005. Best Paper Award. [ bib | conference version ]

Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce, and Alan Schmitt. XML Goes Native: Run-time Representations for Xtatic. In 14th International Conference on Compiler Construction (CC), Edinburgh, UK, April 2005. [ bib | tech report | conference version ]

J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, and Alan Schmitt. Combinators for Bi-Directional Tree Transformations: A Linguistic Approach to the View Update Problem. In Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pages 233--246, Long Beach, CA, USA, 2005. Most Influential POPL Paper Award, 2015. Extended version available as University of Pennsylvania technical report MS-CIS-03-08. Earlier version presented at the Workshop on Programming Language Technologies for XML (PLAN-X), 2004. [ bib | tech report | conference version | slides ]

Alan Schmitt and Jean-Bernard Stefani. The M-Calculus: A Higher Order Distributed Process Calculus. In Proceeding 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2003), New Orleans, LA, USA, January 2003. [ bib | conference version ]

Alan Schmitt. Safe Dynamic Binding in the Join Calculus. In R. Baeza-Yates, U. Montanari, and N. Santoro, editors, Proceedings of IFIP TCS 2002, volume 96 of IFIP, pages 563--575, Montreal, Canada, 2002. Kluwer. [This is the original version that was accepted for publication, before the page cut requested for the final version. This version contains additional examples.]. [ bib | conference version ]

Cédric Fournet, Jean-Jacques Lévy, and Alan Schmitt. An Asynchronous Distributed Implementation of Mobile Ambients. In J. van Leeuwen, O. Watanabe, M. Hagiya, P.D. Mosses, and T. Ito, editors, Proceedings of the International IFIP Conference TCS 2000 (Sendai, Japan), volume 1872 of Lecture Notes in Computer Science, pages 348--364, Sendai, Japan, August 2000. IFIP, Springer. [ bib | conference version ]