313 search results - page 17 / 63 » Formalizing the Halting Problem in a Constructive Type Theor... |
IMPERIAL
1994
13 years 11 months ago
1994
The \observational content" of geometric logic is discussed and it is proposed that geometric logic is an appropriate basis for a Z-like speci cation language in which schema...
APSEC
2000
IEEE
14 years 5 days ago
2000
IEEE
It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modell...
TLDI
2003
ACM
14 years 1 months ago
2003
ACM
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
POPL
1998
ACM
13 years 12 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...