Sciweavers

3658 search results - page 397 / 732
» The logic of proofs, semantically
Sort
View
ESWS
2006
Springer
15 years 10 months ago
Reconciling Concepts and Relations in Heterogeneous Ontologies
In the extensive usage of ontologies envisaged by the Semantic Web there is a compelling need for expressing mappings between the components of heterogeneous ontologies. These mapp...
Chiara Ghidini, Luciano Serafini
IPPS
2006
IEEE
16 years 25 days ago
A calculus of functional BSP programs with projection
Bulk Synchronous Parallel ML (BSML) is an extension of the functional language Objective Caml to program Bulk Synchronous Parallel (BSP) algorithms. It is deterministic, deadlock ...
Frédéric Loulergue
COMPASS
1994
15 years 11 months ago
Types, Subtypes, and ASL+
ASL+ is a formalism for speci cation and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and re nement of speci cations, whic...
David Aspinall
ENTCS
2002
90views more  ENTCS 2002»
15 years 6 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
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 4 months ago
Interactive Learning Based Realizability and 1-Backtracking Games
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
Federico Aschieri