443 search results - page 8 / 89 » A Simple Solution to Type Specialization |
TLCA
2007
Springer
14 years 1 months 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...
HASKELL
2005
ACM
14 years 27 days ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
CACM
1998
13 years 7 months ago
1998
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...
MOC
2002
13 years 7 months ago
2002
An essential part of any boundary value problem is the domain on which the problem is defined. The domain is often given by scanning or another digital image technique with limited...
RA
2003
13 years 8 months ago
2003
In this paper, we describe a parallel solution scheme of inverse dynamics, and its application to flexible manipulators where elastic deformation and vibration normally occur in c...