32 search results - page 5 / 7 » A Meta-Programming Approach to Realizing Dependently Typed L... |
140
click to vote
RSCTC
2000
Springer
15 years 6 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
126
Voted
ESWS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
143
Voted
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
110
click to vote
ICFP
2002
ACM
16 years 2 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
130
Voted
IFL
2003
Springer
15 years 8 months ago
2003
Springer
It is important to be able to program GUI applications in a fast and easy manner. Current GUI tools for creating visually attractive applications offer limited functionality. In t...