Sciweavers

306 search results - page 2 / 62
» Conversation Types
Sort
View
PLANX
2007
13 years 6 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
ACL
2008
13 years 6 months ago
You Talking to Me? A Corpus and Algorithm for Conversation Disentanglement
When multiple conversations occur simultaneously, a listener must decide which conversation each utterance is part of in order to interpret and respond to it appropriately. We ref...
Micha Elsner, Eugene Charniak
TEX
2004
Springer
283views Latex» more  TEX 2004»
13 years 10 months ago
Creating Type 1 Fonts from METAFONT Sources
This paper summarizes experiences in converting METAFONT fonts to PostScript fonts with TEXtrace and mftrace, based on programs of autotracing bitmaps (AutoTrace and potrace), and...
Karel Píska
PLPV
2010
ACM
14 years 2 months ago
Singleton types here, singleton types there, singleton types everywhere
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
Stefan Monnier, David Haguenauer