1321 search results - page 246 / 265 » Subtyping in Logical Form |
CADE
2001
Springer
15 years 9 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
175
click to vote
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly manag...
ICSE
2005
IEEE-ACM
15 years 9 months ago
2005
IEEE-ACM
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
89
Voted
ICSE
2005
IEEE-ACM
15 years 9 months ago
2005
IEEE-ACM
Existing spreadsheet systems allow users to change cells arbitrarily, which is a major source of spreadsheet errors. We propose a system that prevents errors in spreadsheets by re...