Sciweavers

167 search results - page 10 / 34
» Translation as Weighted Deduction
Sort
View
ESOP
2001
Springer
14 years 1 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
COLING
2008
13 years 10 months ago
Phrasal Segmentation Models for Statistical Machine Translation
Phrasal segmentation models define a mapping from the words of a sentence to sequences of translatable phrases. We discuss the estimation of these models from large quantities of ...
Graeme W. Blackwood, Adrià de Gispert, Will...
TABLEAUX
2007
Springer
14 years 3 months ago
Tree-Sequent Methods for Subintuitionistic Predicate Logics
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
Ryo Ishigaki, Kentaro Kikuchi
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 9 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
DLT
2009
13 years 6 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin