86 search results - page 13 / 18 » Lambda Logic |
147
click to vote
ICFP
2003
ACM
16 years 3 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
119
Voted
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
146
Voted
EMNLP
2009
15 years 1 months ago
2009
We present the first unsupervised approach to the problem of learning a semantic parser, using Markov logic. Our USP system transforms dependency trees into quasi-logical forms, r...
141
click to vote
FLOPS
2004
Springer
15 years 9 months ago
2004
Springer
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
118
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...