Sciweavers

1914 search results - page 9 / 383
» Abstract lambda-Calculus Machines
Sort
View
SIAMCOMP
2008
86views more  SIAMCOMP 2008»
13 years 7 months ago
The Complexity of Monadic Second-Order Unification
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
DEXAW
2007
IEEE
138views Database» more  DEXAW 2007»
14 years 2 months ago
Machine Learning for Question Answering from Tabular Data
Question Answering (QA) systems automatically answer natural language questions in a human-like manner. One of the practical approaches to open domain QA consists in extracting fa...
Mahboob Alam Khalid, Valentin Jijkoun, Maarten de ...
ICFP
2010
ACM
13 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...
PLDI
2005
ACM
14 years 1 months ago
Permission-based ownership: encapsulating state in higher-order typed languages
Today’s module systems do not effectively support information hiding in the presence of shared mutable objects, causing serious problems in the development and evolution of larg...
Neelakantan R. Krishnaswami, Jonathan Aldrich
ECOOP
2010
Springer
14 years 13 days ago
Recency Types for Analyzing Scripting Languages
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
Phillip Heidegger, Peter Thiemann