458 search results - page 15 / 92 » A Dependently Typed Assembly Language |
PADL
2004
Springer
14 years 27 days ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
IFL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
TACAS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...