Sciweavers

6740 search results - page 304 / 1348
» Using Classification as a Programming Language
Sort
View
ESOP
2009
Springer
15 years 9 months ago
Amortised Memory Analysis Using the Depth of Data Structures
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
Brian Campbell
IFL
2005
Springer
103views Formal Methods» more  IFL 2005»
15 years 8 months ago
Accurate Step Counting
Abstract Starting with an evaluator for a language, an abstract machine for the same language can be mechanically derived using successive program transformations. This has relevan...
Catherine Hope, Graham Hutton
DKE
2008
114views more  DKE 2008»
15 years 2 months ago
Proof explanation for a nonmonotonic Semantic Web rules language
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
Grigoris Antoniou, Antonis Bikakis, Nikos Dimaresi...
EMNLP
2007
15 years 4 months ago
Compressing Trigram Language Models With Golomb Coding
Trigram language models are compressed using a Golomb coding method inspired by the original Unix spell program. Compression methods trade off space, time and accuracy (loss). The...
Kenneth Church, Ted Hart, Jianfeng Gao
ESOP
2009
Springer
15 years 9 months ago
Well-Typed Programs Can't Be Blamed
We show how contracts with blame fit naturally with recent work on hybrid types and gradual types. Unlike hybrid types or gradual types, we require casts in the source code, in o...
Philip Wadler, Robert Bruce Findler