A mechanized theory of regular trees in dependent type theory
R Spadotti - … Theorem Proving: 6th International Conference, ITP …, 2015 - Springer
Regular trees are potentially infinite trees such that the set of distinct subtrees is finite. This
paper describes an implementation of regular trees in dependent type theory. Regular trees …
paper describes an implementation of regular trees in dependent type theory. Regular trees …
Verification of redecoration for infinite triangular matrices using coinduction
Finite triangular matrices with a dedicated type for the diagonal elements can be profitably
represented by a nested data type, ie, a heterogeneous family of inductive data types, while …
represented by a nested data type, ie, a heterogeneous family of inductive data types, while …
[PDF][PDF] An Approach for Modular Verification of Multi-Result Supercompilers
DN Krustev - … on Metacomputa-tion//Proceedings of the …, 2014 - meta2014.pereslavl.ru
Multi-result supercompilation is a recent and promising generalization of classical
supercompilation. One of its goals is to permit easy construction of different supercompilers …
supercompilation. One of its goals is to permit easy construction of different supercompilers …
[PDF][PDF] Inductive representation, proofs and refinement of pointer structures
M Giorgino - 2013 - core.ac.uk
How to convince ourselves that a piece of software is failure-free? In a world where our lives
increasingly depend on technologies, what are the guarantees that the computations …
increasingly depend on technologies, what are the guarantees that the computations …