Jean-Philippe Bernardy
Showing 33 publications
Domain-Specific Tensor Languages
Learning Structure-Aware Representations of Dependent Types
Algebraic Positional Encodings
Domain-Specific Languages of Mathematics
Dynamic IFC Theorems for Free!
Simple Noninterference from Parametricity
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
Efficient Parallel and Incremental Parsing
Efficient parallel and incremental parsing of practical context-free languages
A Presheaf Model of Parametric Type Theory
Names for free: polymorphic views of names and binders
Compiling Linear Logic using Continuations
Efficient Divide-and-Conquer Parsing of Practical Context-Free Languages
Names For Free - Polymorphic Views of Names and Binders
Efficient divide-and-conquer parsing of practical context-free languages
Proofs for Free - Parametricity for dependent types
A Computational Interpretation of Parametricity
Realizability and Parametricity in Pure Type Systems
Towards a computational interpretation of parametricity
Generic programming with C++ concepts and Haskell type classes—a comparison
Testing Polymorphic Properties
Parametricity and dependent types
An abstraction theorem for pure type systems
Parametricity and Dependent Types
Software Engineering using Typed Functional Programming
Yi An Editor in Haskell for Haskell
Lazy Functional Incremental Parsing
A comparison of C++ concepts and Haskell type classes
Yi - An Editor in Haskell for Haskell
Reviving Pacbase COBOL-Generated Code
Download publication list
You can download this list to your computer.
Filter and download publication list
As logged in user (Chalmers employee) you find more export functions in MyResearch.
You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:
Zotero Connector
Mendeley Web Importer
The service SwePub offers export of contents from Research in other formats, such as Harvard and Oxford in .RIS, BibTex and RefWorks format.
Showing 1 research projects
Strongly Typed Libraries for Programs and Proofs