Sciweavers

2225 search results - page 357 / 445
» Logical Structures in the Lexicon
Sort
View
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 3 months ago
Polarized Montagovian Semantics for the Lambek-Grishin calculus
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
Arno Bastenhof
POPL
2011
ACM
12 years 10 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
ISPD
2012
ACM
289views Hardware» more  ISPD 2012»
12 years 3 months ago
Keep it straight: teaching placement how to better handle designs with datapaths
As technology scales and frequency increases, a new design style is emerging, referred to as hybrid designs, which contain a mixture of random logic and datapath standard cell com...
Samuel I. Ward, Myung-Chul Kim, Natarajan Viswanat...
POPL
2012
ACM
12 years 3 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
POPL
2012
ACM
12 years 3 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer