1999 search results - page 89 / 400 » Dependently Typed Grammars |
215
click to vote
BMEI
2008
IEEE
15 years 8 months ago
2008
IEEE
Keys are character based tools for plant identification. They are based on the decomposition of the plant into very small, atomistic parts. These parts are described with the tech...
142
click to vote
RC
2007
15 years 5 months ago
2007
Abstract. In engineering applications, we need to make decisions under uncertainty. Traditionally, in engineering, statistical methods are used, methods assuming that we know the p...
180
click to vote
FROCOS
2005
Springer
15 years 11 months ago
2005
Springer
ATS is a language with a highly expressive type system that supports a restricted form of dependent types in which programs are not allowed to appear in type expressions. The langu...
179
click to vote
LICS
2009
IEEE
16 years 25 days ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
168
click to vote
TLCA
2007
Springer
16 years 9 days ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...