Sciweavers

917 search results - page 124 / 184
» On the Semantics of Updates in a Functional Language
Sort
View
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
15 years 3 months ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
15 years 2 months ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
PPDP
2000
Springer
15 years 1 months ago
A model for comparing the space usage of lazy evaluators
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
Adam Bakewell, Colin Runciman
EACL
2006
ACL Anthology
14 years 11 months ago
Exploiting Shallow Linguistic Information for Relation Extraction from Biomedical Literature
We propose an approach for extracting relations between entities from biomedical literature based solely on shallow linguistic information. We use a combination of kernel function...
Claudio Giuliano, Alberto Lavelli, Lorenza Romano
CN
2002
111views more  CN 2002»
14 years 9 months ago
Analysis and optimisation of event-condition-action rules on XML
XML is a now a dominant standard for storing and exchanging information. With its increasing use in areas such as data warehousing and e-commerce, there is a rapidly growing need ...
James Bailey, Alexandra Poulovassilis, Peter T. Wo...