The following pages link to Jean-Philippe Bernardy (Q2035842):
Displayed 16 items.
- A computational treatment of anaphora and its algorithmic implementation (Q2035844) (← links)
- Proofs for free (Q2844694) (← links)
- A Computational Interpretation of Parametricity (Q2986790) (← links)
- Realizability and Parametricity in Pure Type Systems (Q3000602) (← links)
- Generic programming with C++ concepts and Haskell type classes—a comparison (Q3070769) (← links)
- Testing Polymorphic Properties (Q3558219) (← links)
- (Q5015096) (← links)
- (Q5096574) (← links)
- Parametricity and dependent types (Q5176953) (← links)
- Type-theory in color (Q5244789) (← links)
- Efficient divide-and-conquer parsing of practical context-free languages (Q5244794) (← links)
- Efficient parallel and incremental parsing of practical context-free languages (Q5371946) (← links)
- Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda (Q5739890) (← links)
- A presheaf model of parametric type theory (Q5971392) (← links)
- Algebraic effects for extensible dynamic semantics (Q6156625) (← links)
- Unitary Recurrent Networks: Algebraic and Linear Structures for Syntax (Q6167032) (← links)