The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e.,...
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
The interface with the outside world has always been one of the weakest points of functional languages. It is not easy to incorporate I/O without being allowed to do side-effects....
Peter Achten, John H. G. van Groningen, Marinus J....
In philosophy, the term ontology has been used since the 17th century to refer both to a philosophical discipline (Ontology with a capital "O"), and as a domain-independe...
The invited talk will introduce Computer-Aided Language Processing (CALP) as an emerging area of practical interest and significance and will present experiments of several CALP a...