Sciweavers

1912 search results - page 147 / 383
» On the evaluation of argumentation formalisms
Sort
View
IFL
2007
Springer
158views Formal Methods» more  IFL 2007»
16 years 19 days ago
Checking Dependent Types Using Compiled Code
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
Dirk Kleeblatt
IFL
2007
Springer
146views Formal Methods» more  IFL 2007»
16 years 19 days ago
A Supercompiler for Core Haskell
Haskell is a functional language, with features such as higher order functions and lazy evaluation, which allow succinct programs. These high-level features present many challenges...
Neil Mitchell, Colin Runciman
ENTCS
2008
146views more  ENTCS 2008»
15 years 6 months ago
Complete Laziness: a Natural Semantics
Lazy evaluation (or call-by-need) is widely used and well understood, partly thanks to a clear operational semantics given by Launchbury. However, modern non-strict functional lan...
François-Régis Sinot
WWW
2004
ACM
16 years 7 months ago
Choosing the best knowledge base system for large semantic web applications
We present an evaluation of four knowledge base systems with respect to use in large Semantic Web applications. We discuss the performance of each system. In particular, we show t...
Yuanbo Guo, Zhengxiang Pan, Jeff Heflin
AIMSA
2008
Springer
16 years 25 days ago
ASAP- An Advanced System for Assessing Chat Participants
: Although instant messaging is a very popular tool for collaboration and it has been used for a wide variety of CSCL tasks, there are only a few applications for assisting the tut...
Mihai Dascalu, Erol-Valeriu Chioasca, Stefan Traus...