6167 search results - page 969 / 1234 » Can Refinement be Automated |
94
Voted
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
84
Voted
LICS
2007
IEEE
15 years 7 months ago
2007
IEEE
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
119
Voted
SOCA
2007
IEEE
15 years 7 months ago
2007
IEEE
The emerging ubiquitous computing vision is characterized by decentralized and ad hoc interoperation among devices and networks for access to services. Interacting devices or grou...
TPHOL
2007
IEEE
15 years 7 months ago
2007
IEEE
Cminor is a mid-level imperative programming language; there are proved-correct optimizing compilers from C to Cminor and from Cminor to machine language. We have redesigned Cminor...
117
click to vote
TPHOL
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...