1999 search results - page 134 / 400 » Dependently Typed Grammars |
129
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
153
click to vote
EACL
1993
ACL Anthology
15 years 7 months ago
1993
ACL Anthology
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
174
click to vote
HASKELL
2006
ACM
16 years 8 days ago
2006
ACM
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
203
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
206
click to vote
CISS
2007
IEEE
15 years 10 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...