Sciweavers

16 search results - page 3 / 4
» A call-by-name lambda-calculus machine
Sort
View
130
Voted
POPL
1996
ACM
15 years 7 months ago
From Region Inference to von Neumann Machines via Region Representation Inference
Region Inference is a technique for implementing programming languages that are based on typed call-by-value lambda calculus, such as Standard ML. The mathematical runtime model o...
Lars Birkedal, Mads Tofte, Magnus Vejlstrup
146
Voted
DEXAW
2007
IEEE
138views Database» more  DEXAW 2007»
15 years 10 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 ...
176
Voted
POPL
1989
ACM
15 years 7 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
236
Voted
POPL
2007
ACM
16 years 3 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
118
Voted
ESOP
2001
Springer
15 years 8 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori