Sciweavers

1689 search results - page 142 / 338
» Refining abstract interpretations
Sort
View
ICFP
2006
ACM
16 years 4 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
15 years 10 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
ENTCS
2002
125views more  ENTCS 2002»
15 years 4 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
AUSAI
2007
Springer
15 years 11 months ago
The Semantic Representation of Temporal Expressions in Text
Abstract. Temporal expressions—references to points in time or periods of time—are widespread in text, and their proper interpretation is essential for any natural language pro...
Robert Dale, Pawel P. Mazur
IFSA
2007
Springer
158views Fuzzy Logic» more  IFSA 2007»
15 years 11 months ago
Fuzziness and Performance: An Empirical Study with Linguistic Decision Trees
Abstract. Generally, there are two main streams of theories for studying uncertainties. One is probability theory and the other is fuzzy set theory. One of the basic ideas of fuzzy...
Zengchang Qin, Jonathan Lawry