1 |
From MinX to MinC: Semantics-Driven Decompilation of Recursive Datatypes
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Proofs You Can Believe In. Proving Equivalences Between Prolog Semantics in Coq
|
|
|
|
In: 15th International Symposium on Principles and Practice of Declarative Programming (PPDP) ; https://hal.inria.fr/hal-00908848 ; 15th International Symposium on Principles and Practice of Declarative Programming (PPDP), Sep 2013, Madrid, Spain. pp.37-48 (2013)
|
|
BASE
|
|
Show details
|
|
|
|