Sciweavers

303 search results - page 4 / 61
» Theory Interpretation in Simple Type Theory
Sort
View
ELP
1991
13 years 11 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning
JSYML
2006
71views more  JSYML 2006»
13 years 7 months ago
The generalised type-theoretic interpretation of constructive set theory
Abstract. We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-L
Peter Aczel, Nicola Gambino
TLCA
2007
Springer
14 years 1 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
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...
Denis Cousineau 0002, Gilles Dowek
ENTCS
2002
90views more  ENTCS 2002»
13 years 7 months ago
Simple Easy Terms
We illustrate the use of intersection types as a semantic tool for proving easiness result on -terms. We single out the notion of simple easiness for -terms as a useful semantic p...
Fabio Alessi, Stefania Lusin
RSKT
2009
Springer
14 years 2 months ago
Three-Way Decision: An Interpretation of Rules in Rough Set Theory
Abstract. A new interpretation of rules in rough set theory is introduced. According to the positive, boundary, and negative regions of a set, one can make a three-way decision: ac...
Yiyu Yao