Sciweavers

134 search results - page 16 / 27
» Reversible logic for supercomputing
Sort
View
ACL
1990
13 years 11 months ago
Automated Inversion of Logic Grammars for Generation
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
Tomek Strzalkowski, Ping Peng
APAL
2005
97views more  APAL 2005»
13 years 9 months ago
Polarized and focalized linear and classical proofs
We give the precise correspondence between polarized linear logic and polarized classical logic. The properties of focalization and reversion of linear proofs are at the heart of ...
Olivier Laurent, Myriam Quatrini, Lorenzo Tortora ...
WCRE
2007
IEEE
14 years 4 months ago
Parametric Process Model Inference
Legacy applications can be difficult and time-consuming to understand and update due to the lack of modern abstraction mechanisms in legacy languages, as well as the gradual dete...
Saurabh Sinha, G. Ramalingam, Raghavan Komondoor
APAL
2010
88views more  APAL 2010»
13 years 10 months ago
Nonstandard arithmetic and recursive comprehension
First order reasoning about hyperintegers can prove things about sets of integers. In the author's paper Nonstandard Arithmetic and Reverse Mathematics, Bulletin of Symbolic L...
H. Jerome Keisler
ESOP
2010
Springer
14 years 7 months ago
Amortised Resource Analysis with Separation Logic
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
Robert Atkey