1950 search results - page 136 / 390 » Lambda-Free Logical Frameworks |
156
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on de...
151
click to vote
SBIA
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. The ability to view extended logic programs as argumentation systems opens the way for the use of this language in formalizing communication among reasoning computing age...
169
Voted
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
The notion of a bilattice was rst proposed by Ginsberg as a general framework for many applications. This notion was further investigated and applied for various goals by Fitting....
192
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...
172
click to vote
GLVLSI
2005
IEEE
16 years 10 days ago
2005
IEEE
Switching model captures the data-driven uncertainty in logic circuits in a comprehensive probabilistic framework. Switching is a critical factor that influences dynamic, active ...