Abstract Syntax and Variable Binding (Extended Abstract) (2009)
Marcelo Fiorecogs, Daniele Turi
\Lambda LFCSUniv. of Edinburgh
Web Services for the DDSM and Digital Mammography Research (2008)
Chris Rose, Daniele Turi, Alan Williams, Katy Wolstencroft, Chris Taylor
Abstract. The Digital Database for Screening Mammography (DDSM) is an invaluable resource for digital mammography research. However, there are two particular shortcomings that can pose a significant...
Taverna Workflows: Syntax and Semantics (2008)
Daniele Turi, Paolo Missier, Carole Goble, David De Roure
This paper presents the formal syntax and the operational semantics of Taverna, a workflow management system with a large user base among the e-Science community. Such formal foundation, which has so...
Algebraic and Coalgebraic Methods in the Semantics of Programming Languages (2008)
Daniele Turi, Summer Term, Typeset Foiltex
8 Lectures The aim of this course is to give a gentle introduction to the mathematical theory of structural operational semantics of [TP97] and to the algebraic treatment of syntax with variable...
TheLaboratoryforFoundationsofComputerScience,Edinburgh (2008)
anditsDenotationalDual terverkrijgingvandegraadvandoctoraan deVrijeUniversiteitteAmsterdam, ACADEMISCHPROEFSCHRIFT opgezagvanderectormagnicus vandefaculteitderwiskundeeninformatica...
Abstract A Coalgebraic Foundation for Linear Time Semantics (2008)
We present a coalgebraic approach to trace equivalence semantics based on lifting behaviour endofunctors for deterministic action to Kleisli categories of monads for non-deterministic choice. In Set,...
20 Taverna / my Grid: aligning a workflow system with the life sciences community (2008)
Tom Oinn, Peter Li, Douglas B. Kell, Carole Goble, Antoon Goderis, Mark Greenwood, ...
Bioinformatics is a discipline that uses computational and mathematical techniques to store, manage and analyse biological data in order to answer biological questions. Bioinformatics has over 850...
Luc Moreau, Bertram Ludäscher, Ilkay Altintas, Roger S. Barga, Shawn Bowers, George Chin, ...
The first Provenance Challenge was a community activity aiming at understanding the expressiveness of provenance representations and capabilities of provenance systems. To this end, a Functional...
Luc Moreau, Bertram Ludäscher, Ilkay Altintas, Roger S. Barga, Shawn Bowers, Steven Callahan, ...
The first Provenance Challenge was set up in order to provide a forum for the community to understand the capabilities of different provenance systems and the expressiveness of their provenance...
Taverna Workflows: Syntax and Semantics (2007)
Missier, Paolo, Turi, Daniele, Goble, Carole, Oinn, Tom, De Roure, David
This paper presents the formal syntax and the operational semantics of Taverna, a workflow management system with a large user base among the e-Science community. Such formal foundation, which has so...
Machine. Theoretical Computer Science, 96:217--248, 1992. 218 Bibliography [BE87] J. Barwise and J. Etchemendy. The Liar: An Essay in Truth and Circularity. Oxford University Press, 1987. [Bec69] Jon...
We provide a semantic framework for (first order) message-passing process calculi by combining categorical theories of abstract syntax with binding and operational semantics. In particular, we obtain...
Contents Introduction 1 1 Universal Problems 1 1.1 Natural Numbers in set theory and category theory . . . . . . . . . . . . . . . 1 1.2 Universals . . . . . . . . . . . . . . . . . . . . . . . . . ....
Taverna Workflows: Syntax and Semantics (2007)
Missier, Paolo, Turi, Daniele, Goble, Carole, Oinn, Tom, De Roure, David
This paper presents the formal syntax and the operational semantics of Taverna, a workflow management system with a large user base among the e-Science community. Such formal foundation, which has so...
Knowledge Discovery for in silico Experiments with Taverna (2006)
Goble, Carole, Wolstencroft, Katy, Goderis, Antoon, Hull, Duncan, Zhao, Jun, Alper, Pinar, ...
Knowledge Discovery for in silico Experiments with Taverna (2006)
Goble, Carole, Wolstencroft, Katy, Goderis, Antoon, Hull, Duncan, Zhao, Jun, Alper, Pinar, ...
Knowledge Discovery for in silico Experiments with Taverna (2006)
Goble, Carole, Wolstencroft, Katy, Goderis, Antoon, Hull, Duncan, Zhao, Jun, Alper, Pinar, ...
The OWL instance store: System description (2005)
Sean Bechhofer, Ian Horrocks, Daniele Turi
Abstract. We describe the instance store, a system for reasoning about individuals (i.e., instances of classes) in OWL ontologies. By using a hybrid reasoner/database architecture, our system is able...
The instance store: DL reasoning with large numbers of individuals (2004)
Ian Horrocks, Lei Li, Daniele Turi, Sean Bechhofer
We present an application – the Instance Store – aimed at solving some of the scalability problems that arise when reasoning with the large numbers of individuals envisaged in the semantic web....
The instance store: Description logic reasoning with large numbers of individuals (2004)
Ian Horrocks, Lei Li, Daniele Turi, Sean Bechhofer
Abstract. We present an application – the Instance Store – aimed at solving some of the scalability problems that arise when reasoning with the large numbers of individuals envisaged in the...
The instance store: DL reasoning with large numbers of individuals (2004)
Ian Horrocks, Lei Li, Daniele Turi, Sean Bechhofer
We present an application – the Instance Store – aimed at solving some of the scalability problems that arise when reasoning with the large numbers of individuals envisaged in the semantic web....
Using Reasoning to Guide Annotation with Gene Ontology Terms (2004)
Michael Bada, Daniele Turi, Robin Mcentire, Robert Stevens
High-quality annotation of biological data is central to bioinformatics. Annotation using terms from ontologies provides reliable computational access to data. The Gene Ontology (GO), a structured...
Implementing the instance store (2004)
Sean Bechhofer, Ian Horrocks, Daniele Turi
We describe the implementation of the instance store, a DL system using a combination of TBox reasoning and database queries to perform efficient and scalable role-free ABox reasoning. 1
Mathematical service matching using Description Logic and OWL (2004)
Olga Caprotti, Mike Dewar, Daniele Turi
Abstract. Web Service technology is increasingly being used to develop distributed applications, however the convention is to describe individual services in terms of the interfaces that they expose,...
The instance store: DL reasoning with large numbers of individuals (2004)
Ian Horrocks, Lei Li, Daniele Turi, Sean Bechhofer
The Semantic Web [4] aims at making Web resources more accessible to automated processes by adding “semantic annotations”—metadata (data about data) that describes their content. It is...
Abstract Syntax and Variable Binding (Extended Abstract) (2003)
Fiore, Marcelo P, Plotkin, Gordon, Turi, Daniele
We develop a theory of abstract syntax with variable binding. To every binding signature we associate a category of models consisting of variable sets endowed with compatible algebra and substitution...
Abstract Syntax and Variable Binding (Extended Abstract) (2003)
Fiore, Marcelo P, Plotkin, Gordon, Turi, Daniele
We develop a theory of abstract syntax with variable binding. To every binding signature we associate a category of models consisting of variable sets endowed with compatible algebra and substitution...
Towards a Mathematical Operational Semantics (2003)
Plotkin, Gordon, Turi, Daniele
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is...
Towards a Mathematical Operational Semantics (2003)
Plotkin, Gordon, Turi, Daniele
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational se- mantics to form a coherent whole. It is...
Sean Bechhofer, Ian Horrocks, Daniele Turi
We implement an elementary, yet useful form of A-box reasoning using a database to store asserted descriptions of individuals. This provides an effective instance store which can be used in a wide...
Semantics of Name and Value Passing (2001)
We provide a semantic framework for (first order) message-passing process calculi by combining categorical theories of abstract syntax with binding and operational semantics. In particular, we obtain...
A Coalgebraic Foundation for Linear Time Semantics (1999)
We present a coalgebraic approach to trace equivalence semantics based on lifting behaviour endofunctors for deterministic action to Kleisli categories of monads for non-deterministic choice. In Set...
Abstract syntax and variable binding (extended abstract (1999)
Marcelo Fiore, Gordon Plotkin, Daniele Turi
Abstract We develop a theory of abstract syntax with variable binding. To every binding signature we associate a category of models consisting of variable sets endowed with both a (binding) algebra...
Daniele Turi, Jan Rutten, Partial Orders, Metric Spaces
ion) Given a coalgebraic operational model [[-]] : Prog ! B(Prog) of a language with programs P 2 Prog and behaviour B such that pullbacks lift to B-bisimulations (as, eg, in Proposition 4.4), two...
Categorical Modelling of Structural Operational Rules - Case Studies (1997)
. This paper aims at substantiating a recently introduced categorical theory of `well-behaved' operational semantics. A variety of concrete examples of structural operational rules is modelled...
Towards a Mathematical Operational Semantics (1997)
We present a categorical theory of `well-behaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is...
Towards a mathematical operational semantics (1997)
We present a categorical theory of ‘well-behaved’ operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is...
Initial algebra and final coalgebra semantics for concurrency (1994)
D. Turi, Jan Rutten, Daniele Turi
The aim of this paper is to relate initial algebra semantics and final coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and...
D. Turi, Jan Rutten, Daniele Turi
The aim of this paper is to relate initial algebra semantics and nal coalgebra semantics. It is shown how these two approaches to the semantics of programming languages are each others dual, and some...