30 search results - page 5 / 6 » Types and higher-order recursion schemes for verification of... |
TPHOL
2003
IEEE
13 years 11 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
FOSSACS
2010
Springer
13 years 9 months ago
2010
Springer
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
ICFP
2002
ACM
14 years 5 months ago
2002
ACM
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
IFL
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...