Jean-Philippe Bernardy

Forskarassistent at Software Technology (Chalmers)

Projects

2012–2015

Strongly Typed Libraries for Programs and Proofs

Patrik Jansson Software Technology (Chalmers)
Jean-Philippe Bernardy Software Technology (Chalmers)
Cezar Ionescu Software Technology (Chalmers)
Swedish Research Council (VR)

There might be more projects where Jean-Philippe Bernardy participates, but you have to be logged in as a Chalmers employee to see them.

Publications

2016

Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda

Jean-Philippe Bernardy, Patrik Jansson,
Logical Methods in Computer Science. Vol. 12 (2), p. 28
Scientific journal article - peer reviewed
2015

Efficient parallel and incremental parsing of practical context-free languages

Jean-Philippe Bernardy, Koen Claessen,
Journal of Functional Programming. Vol. 25, p. Article Number: UNSP e10
Scientific journal article - peer reviewed
2015

A Presheaf Model of Parametric Type Theory

Jean-Philippe Bernardy, Thierry Coquand, Guilhem Moulin et al
Electronical Notes in Theoretical Computer Science. Vol. 319, p. 67-82
Scientific journal article - peer reviewed
2015

Efficient Parallel and Incremental Parsing

Jean-Philippe Bernardy, Koen Claessen,
Journal of functional programming
Scientific journal article - peer reviewed
2015

A presheaf model of parametric type theory

Jean-Philippe Bernardy, Thierry Coquand, Guilhem Moulin et al
Preprint
2014

Compiling Linear Logic using Continuations

Jean-Philippe Bernardy, Dan Rosén, Nicholas Smallbone et al
Preprint
2013

Names for free: polymorphic views of names and binders

Jean-Philippe Bernardy, Nicolas Pouillard,
ACM SIGPLAN Notices. Vol. 12, p. 13-24
Scientific journal article - peer reviewed
2013

Efficient Divide-and-Conquer Parsing of Practical Context-Free Languages

Jean-Philippe Bernardy, Koen Claessen,
SIGPLAN notices. Vol. 48 (9), p. 111-122
Scientific journal article - peer reviewed
2013

Type-Theory In Color

Jean-Philippe Bernardy, Guilhem Moulin,
ACM SIGPLAN Notices. Vol. 48 (9), p. 61-71
Scientific journal article - peer reviewed
2013

Efficient divide-and-conquer parsing of practical context-free languages

Jean-Philippe Bernardy, Koen Claessen,
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP, p. 111-122
Conference paper - peer reviewed
2013

Names For Free - Polymorphic Views of Names and Binders

Jean-Philippe Bernardy, Nicolas Pouillard,
ACM SIGPLAN Haskell Symposium Co-located with ICFP. Vol. 48 (12), p. 13-24
Conference paper - peer reviewed
2013

Type-Theory in Color

Jean-Philippe Bernardy, Guilhem Moulin,
18th ACM SIGPLAN International Conference on Functional Programming, ICFP 2013; Boston, MA; United States; 25 September 2013 through 27 September 2013, p. 61-71
Conference paper - peer reviewed
2012

A Computational Interpretation of Parametricity

Jean-Philippe Bernardy, Guilhem Moulin,
IEEE Symposium on Logic in Computer Science. 27th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Dubrovnik, Croatia, June 25-28, 2012, p. 135-144
Conference paper - peer reviewed
2012

Proofs for Free - Parametricity for dependent types

Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson et al
Journal of Functional Programming. Vol. 22 (2), p. 107-152
Scientific journal article - peer reviewed
2011

Towards a computational interpretation of parametricity

Jean-Philippe Bernardy, Guilhem Moulin,
Preprint
2011

A Theory of Parametric Polymorphism and an Application

Jean-Philippe Bernardy,
Doctoral thesis
2011

Realizability and Parametricity in Pure Type Systems

Jean-Philippe Bernardy, Marc Lasson,
Lecture Notes in Computer Science. 14th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2011. Vol. 6604, p. 108-122
Conference paper - peer reviewed
2010

Parametricity and Dependent Types

Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson et al
SIGPLAN notices. Vol. 45 (9), p. 345-356
Scientific journal article - peer reviewed
2010

Generic programming with C++ concepts and Haskell type classes—a comparison

Jean-Philippe Bernardy, Patrik Jansson, Marcin Zalewski et al
Journal of Functional Programming. Vol. 20 (3-4), p. 271-302
Scientific journal article - peer reviewed
2010

Parametricity and dependent types

Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson et al
International Conference on Functional Programming, September 27-29, 2010, Baltimore, Maryland
Conference paper - peer reviewed
2010

An abstraction theorem for pure type systems

Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson et al
Preprint
2010

Testing Polymorphic Properties

Jean-Philippe Bernardy, Patrik Jansson, Koen Claessen et al
Lecture Notes in Computer Science. 19th European Symposium on Programming, ESOP 2010. Vol. 6012, p. 125-144
Conference paper - peer reviewed
2009

Yi An Editor in Haskell for Haskell

Jean-Philippe Bernardy,
ACM Sigplan Notices. Vol. 44 (2), p. 61-62
Scientific journal article - peer reviewed
2009

Software Engineering using Typed Functional Programming

Jean-Philippe Bernardy,
Licentiate thesis
2009

Lazy Functional Incremental Parsing

Jean-Philippe Bernardy,
ACM SIGPLAN Haskell Symposium 2009, Edinburgh, Scotland Thursday, 3 September, p. 49-60
Conference paper - peer reviewed
2008

Yi - An Editor in Haskell for Haskell

Jean-Philippe Bernardy,
ACM SIGPLAN 2008 Haskell Symposium Victoria, British Columbia, Canada Thursday, 25th September, 2008, p. 61-62
Conference paper - non peer reviewed
2008

A comparison of C++ concepts and Haskell type classes

Jean-Philippe Bernardy, Patrik Jansson, Marcin Zalewski et al
ACM SIGPLAN Workshop on Generic Programming 2008. Victoria, Canada, 20th September 2008, p. 37-48
Conference paper - peer reviewed
2002

Reviving Pacbase COBOL-Generated Code

Jean-Philippe Bernardy,
Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment, p. 741 - 743
Conference paper - peer reviewed