13 citations · 33 across the 8 of their papers we have counts for
3 papers · 1 filter
Extensional equality preservation and verified generic programming
Nicola Botta, Nuria Brede, Patrik Jansson +1
In verified generic programming, one cannot exploit the structure of concrete data types but has to rely on well chosen sets of specifications or abstract data types (ADTs). Functo…
Sequential decision problems, dependent types and generic solutions
Nicola Botta, Patrik Jansson, Cezar Ionescu +2
We present a computer-checked generic implementation for solving finite-horizon sequential decision problems. This is a wide class of problems, including inter-temporal optimizatio…
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
Jean-Philippe Bernardy, Patrik Jansson
Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose. In…