5 search results - page 1 / 1 » From Contracts Towards Dependent Types: Proofs by Partial Ev... |
IFL
2007
Springer
13 years 10 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...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
for an informal presentation at CIE 2007 [2] is a typed -calculus that pursues the reuse of the term constructions both at the level of types and at the level of contexts, while en...
ICFP
2002
ACM
14 years 4 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
ICFP
2002
ACM
14 years 4 months ago
2002
ACM
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
MICRO
2006
IEEE
13 years 10 months ago
2006
IEEE
As the industry moves toward larger-scale chip multiprocessors, the need to parallelize applications grows. High inter-thread communication delays, exacerbated by over-stressed hi...