Jean-Philippe Bernardy

Universitetslektor vid Computing Science

Kontaktuppgifter

Publikationer (30)
Projekt (1)

Visar 30 publikationer

2022

Domain-Specific Languages of Mathematics

Patrik Jansson, Cezar Ionescu, Jean-Philippe Bernardy

Bok

Visa projekt

2021

Dynamic IFC Theorems for Free!

Maximilian Algehed, Jean-Philippe Bernardy, Catalin Hritcu

2021 IEEE 34TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSF 2021), p. 65-78

Paper i proceeding

2019

Simple Noninterference from Parametricity

Maximilian Algehed, Jean-Philippe Bernardy

Proceedings of the ACM on Programming Languages. Vol. 3

Artikel i vetenskaplig tidskrift

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-

Artikel i vetenskaplig tidskrift

2015

Efficient Parallel and Incremental Parsing

Jean-Philippe Bernardy, Koen Lindström Claessen

Journal of Functional Programming

Artikel i vetenskaplig tidskrift

2015

A Presheaf Model of Parametric Type Theory

Jean-Philippe Bernardy, Thierry Coquand, Guilhem Moulin

Electronic Notes in Theoretical Computer Science. Vol. 319, p. 67-82

Artikel i vetenskaplig tidskrift

2015

Efficient parallel and incremental parsing of practical context-free languages

Jean-Philippe Bernardy, Koen Lindström Claessen

Journal of Functional Programming. Vol. 25, p. Article Number: UNSP e10-

Artikel i vetenskaplig tidskrift

2014

Names for free: polymorphic views of names and binders

Jean-Philippe Bernardy, Nicolas Pouillard

ACM SIGPLAN Notices. Vol. 48 (12), p. 13-24

Artikel i vetenskaplig tidskrift

2014

Compiling Linear Logic using Continuations

Jean-Philippe Bernardy, Dan Rosén, Nicholas Smallbone

Preprint

2013

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

Jean-Philippe Bernardy, Koen Lindström Claessen

SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 48 (9), p. 111-122

Artikel i vetenskaplig tidskrift

2013

Names For Free - Polymorphic Views of Names and Binders

Jean-Philippe Bernardy, Nicolas Pouillard

SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 48 (12), p. 13-24

Paper i proceeding

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

Paper i proceeding

2013

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

Jean-Philippe Bernardy, Koen Lindström Claessen

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP, p. 111-122

Paper i proceeding

2013

Type-Theory In Color

Jean-Philippe Bernardy, Guilhem Moulin

SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 48 (9), p. 61-71

Artikel i vetenskaplig tidskrift

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

Paper i proceeding

2012

Proofs for Free - Parametricity for dependent types

Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson

Journal of Functional Programming. Vol. 22 (2), p. 107-152

Artikel i vetenskaplig tidskrift

2011

Realizability and Parametricity in Pure Type Systems

Jean-Philippe Bernardy, Marc Lasson

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6604, p. 108-122

Paper i proceeding

2011

A Theory of Parametric Polymorphism and an Application

Jean-Philippe Bernardy

Doktorsavhandling

2011

Towards a computational interpretation of parametricity

Jean-Philippe Bernardy, Guilhem Moulin

Preprint

2010

Parametricity and dependent types

Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson

International Conference on Functional Programming, September 27-29, 2010, Baltimore, Maryland

Paper i proceeding

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

Artikel i vetenskaplig tidskrift

2010

Parametricity and Dependent Types

Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson

SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 45 (9), p. 345-356

Artikel i vetenskaplig tidskrift

2010

An abstraction theorem for pure type systems

Jean-Philippe Bernardy, Patrik Jansson, Ross Paterson

Preprint

2010

Testing Polymorphic Properties

Jean-Philippe Bernardy, Patrik Jansson, Koen Lindström Claessen

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6012, p. 125-144

Paper i proceeding

2009

Software Engineering using Typed Functional Programming

Jean-Philippe Bernardy

Licentiatavhandling

2009

Yi An Editor in Haskell for Haskell

Jean-Philippe Bernardy

SIGPLAN Notices (ACM Special Interest Group on Programming Languages). Vol. 44 (2), p. 61-62

Artikel i vetenskaplig tidskrift

2009

Lazy Functional Incremental Parsing

Jean-Philippe Bernardy

ACM SIGPLAN Haskell Symposium 2009, Edinburgh, Scotland Thursday, 3 September, p. 49-60

Paper i proceeding

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

Övrigt konferensbidrag

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

Paper i proceeding

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

Paper i proceeding

Ladda ner publikationslistor

Du kan ladda ner denna lista till din dator.

Filtrera och ladda ner publikationslista

Som inloggad användare hittar du ytterligare funktioner i MyResearch.

Du kan även exportera direkt till Zotero eller Mendeley genom webbläsarplugins. Dessa hittar du här:

Zotero Connector
Mendeley Web Importer

Tjänsten SwePub erbjuder uttag av Researchs listor i andra format, till exempel kan du få uttag av publikationer enligt Harvard och Oxford i .RIS, BibTex och RefWorks-format.

Visar 1 forskningsprojekt

2012–2015

Starkt typade bibliotek för program och bevis

Patrik Jansson Programvaruteknik

Jean-Philippe Bernardy Programvaruteknik

Cezar Ionescu Programvaruteknik

Vetenskapsrådet (VR)

Det kan finnas fler projekt där Jean-Philippe Bernardy medverkar, men du måste vara inloggad som anställd på Chalmers för att kunna se dem.