Sciweavers

6618 search results - page 1004 / 1324
» Natural Logic for Natural Language
Sort
View
LICS
1994
IEEE
15 years 11 months ago
Categories, Allegories and Circuit Design
Relational languages such as Ruby are used to derive circuits from abstract speci cations of their behaviour. Much reasoning is done informally in Ruby using pictorial representat...
Carolyn Brown, Graham Hutton
DAC
1992
ACM
15 years 11 months ago
Synthesis from Production-Based Specifications
This paper describes a model for, and an implementation of, production-based synthesis of hardware description language (HDL) code in which the overall structure of the resultant ...
Andrew Seawright, Forrest Brewer
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
15 years 11 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
FOCS
1990
IEEE
15 years 11 months ago
Uniform Memory Hierarchies
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
Bowen Alpern, Larry Carter, Ephraim Feig
FCT
2009
Springer
15 years 10 months ago
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Given a set P of natural numbers, we consider infinite games where the winning condition is a regular -language parametrized by P. In this context, an -word, representing a play, h...
Paul Hänsch, Michaela Slaats, Wolfgang Thomas
« Prev « First page 1004 / 1324 Last » Next »