Sciweavers

5482 search results - page 621 / 1097
» Logic Programming and Databases
Sort
View
ICFP
2010
ACM
15 years 8 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
ICSE
2011
IEEE-ACM
14 years 10 months ago
Unifying execution of imperative and declarative code
We present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, wri...
Aleksandar Milicevic, Derek Rayside, Kuat Yessenov...
ICFP
2012
ACM
13 years 9 months ago
Transporting functions across ornaments
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Pierre-Évariste Dagand, Conor McBride
ICDE
2008
IEEE
191views Database» more  ICDE 2008»
16 years 8 months ago
An Algebraic Approach to Rule-Based Information Extraction
Traditional approaches to rule-based information extraction (IE) have primarily been based on regular expression grammars. However, these grammar-based systems have difficulty scal...
Frederick Reiss, Sriram Raghavan, Rajasekar Krishn...
SIGSOFT
2008
ACM
16 years 7 months ago
Alchemy: transmuting base alloy specifications into implementations
Alloy specifications are used to define lightweight models of systems. We present Alchemy, which compiles Alloy specifications into implementations that execute against persistent...
Shriram Krishnamurthi, Kathi Fisler, Daniel J. Dou...