3047 search results - page 373 / 610 » On the Meaning of Logical Completeness |
73
Voted
PPDP
2009
Springer
15 years 5 months ago
2009
Springer
We propose a novel type inference algorithm for a dependentlytyped functional language. The novel features of our algorithm are: (i) it can iteratively refine dependent types wit...
87
Voted
IEEEARES
2008
IEEE
15 years 5 months ago
2008
IEEE
Preserving integrity of applications being executed in remote machines is an open problem. Integrity requires that application code is not tampered with, prior to or during execut...
ECBS
2007
IEEE
15 years 5 months ago
2007
IEEE
Today, many software-based, reactive systems offer a multitude of functionality. One way to master the development of such a system is to model its functionality on an abstract le...
81
Voted
FUZZIEEE
2007
IEEE
15 years 5 months ago
2007
IEEE
Compositional Modelling (CM) has been applied to synthesize automatically plausible scenarios in many problem domains with promising results. However, it is assumed that the generi...
96
Voted
TPHOL
2007
IEEE
15 years 5 months ago
2007
IEEE
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...