Sciweavers

3001 search results - page 203 / 601
» Recursive type generativity
Sort
View
TIT
1998
90views more  TIT 1998»
15 years 6 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani

Publication
232views
17 years 4 months ago
Multi-stage Programming:  Its Theory and Applications
MetaML is a statically typed functional programming language with special support for program generation. In addition to providing the standard features of contemporary programming...
Walid Taha
ML
2006
ACM
16 years 12 days ago
Seminal: searching for ML type-error messages
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
Benjamin S. Lerner, Dan Grossman, Craig Chambers
MATES
2010
Springer
15 years 4 months ago
Do You Get It? User-Evaluated Explainable BDI Agents
Abstract. In this paper we focus on explaining to humans the behavior of autonomous agents, i.e., explainable agents. Explainable agents are useful for many reasons including scena...
Joost Broekens, Maaike Harbers, Koen V. Hindriks, ...

Publication
226views
17 years 4 months ago
A Gentle Introduction to Multi-stage Programming
Multi-stage programming (MSP) is a paradigm for developing generic software that does not pay a runtime penalty for this generality. This is achieved through concise, carefully-des...
Walid Taha