Sciweavers

681 search results - page 78 / 137
» Combining Theorem Proving with Natural Language Processing
Sort
View
ENTCS
2007
137views more  ENTCS 2007»
14 years 11 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
WWW
2007
ACM
16 years 16 days ago
A search-based Chinese word segmentation method
In this paper, we propose a novel Chinese word segmentation method which leverages the huge deposit of Web documents and search technology. It simultaneously solves ambiguous phra...
Xin-Jing Wang, Yong Qin, Wen Liu
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
15 years 6 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
ICFP
2010
ACM
15 years 2 days ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
ACL
1998
15 years 1 months ago
The Computational Lexical Semantics of Syntagmatic Relations
In this paper, we address the issue of syntagmatic expressions from a computational lexical semantic perspective. From a representational viewpoint, we argue for a hybrid approach...
Evelyne Viegas, Stephen Beale, Sergei Nirenburg