The Experts below are selected from a list of 78 Experts worldwide ranked by ideXlab platform
Vasant Honavar - One of the best experts on this subject based on the ideXlab platform.
-
Collaborative Ontology Building with Wiki@nt
2020Co-Authors: Vasant HonavarAbstract:Collaborative ontology building requires both knowledge integration and knowledge reconciliation. Wiki@nt is an ontology building environment that supports collaborative ontology development. Wiki@nt is based on OSHOQP(D), an extension to SHOQ(D) with O (partial order on axioms) and P (localized axioms in package ) constructors. Wiki@nt supports integration and reconciliation of multiple independently developed, semantically heterogeneous, and very likely inconsistent ontology modules. A web browser based Editor Interface is provided, with features to support team work, version control, page locking, and navigation. Version: July 30, 2004
-
EON - Collaborative Ontology Building with Wiki@nt - A Multi-agent Based Ontology Building Environment.
2020Co-Authors: Vasant HonavarAbstract:Collaborative ontology building requires both knowledge integration and knowledge reconciliation. Wiki@nt is an ontology building environment that supports collaborative ontology development. Wiki@nt is based on OSHOQP(D), an extension to SHOQ(D) with O (partial order on axioms) and P (localized axioms in package ) constructors. Wiki@nt supports integration and reconciliation of multiple independently developed, semantically heterogeneous, and very likely inconsistent ontology modules. A web browser based Editor Interface is provided, with features to support team work, version control, page locking, and navigation. Version: July 30, 2004
Magnus Carlsson - One of the best experts on this subject based on the ideXlab platform.
-
Erratic Fudgets: a semantic theory for an embedded coordination language
Science of Computer Programming, 2020Co-Authors: Andrew Moran, David Sands, Magnus CarlssonAbstract:AbstractThe powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by designing a set of combinators (higher-order reusable programs) for an application area, and by constructing individual applications by combining and coordinating individual combinators. This paper is concerned with a successful example of such an embedded programming language, namely Fudgets, a library of combinators for building graphical user Interfaces in the lazy functional language Haskell. The Fudget library has been used to build a number of substantial applications, including a web browser and a proof Editor Interface to a proof checker for constructive type theory. This paper develops a semantic theory for the non-deterministic stream processors that are at the heart of the Fudget concept. The interaction of two features of stream processors makes the development of such a semantic theory problematic: (i)the sharing of computation provided by the lazy evaluation mechanism of the underlying host language, and(ii)the addition of non-deterministic choice needed to handle the natural concurrency that reactive applications entail. We demonstrate that this combination of features in a higher-order functional language can be tamed to provide a tractable semantic theory and induction principles suitable for reasoning about contextual equivalence of Fudgets
-
COORDINATION - Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language
Coordinatio Languages and Models, 1999Co-Authors: Andrew Moran, David Sands, Magnus CarlssonAbstract:The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by designing a set of combinators (higher-order reusable programs) for an application area, and by constructing individual applications by combining and coordinating individual combinators. This paper is concerned with a successful example of such an embedded programming language, namely Fudgets, a library of combinators for building graphical user Interfaces in the lazy functional language Haskell. The Fudget library has been used to build a number of substantial applications, including a web browser and a proof Editor Interface to a proof checker for constructive type theory. This paper develops a semantic theory for the non-deterministic stream processors that are at the heart of the Fudget concept. The interaction of two features of stream processors makes the development of such a semantic theory problematic: (i) the sharing of computation provided by the lazy evaluation mechanism of the underlying host language, and (ii) the addition of non-deterministic choice needed to handle the natural concurrency that reactive applications entail. We demonstrate that this combination of features in a higher-order functional language can be tamed to provide a tractable semantic theory and induction principles suitable for reasoning about contextual equivalence of Fudgets.
Andrew Moran - One of the best experts on this subject based on the ideXlab platform.
-
Erratic Fudgets: a semantic theory for an embedded coordination language
Science of Computer Programming, 2020Co-Authors: Andrew Moran, David Sands, Magnus CarlssonAbstract:AbstractThe powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by designing a set of combinators (higher-order reusable programs) for an application area, and by constructing individual applications by combining and coordinating individual combinators. This paper is concerned with a successful example of such an embedded programming language, namely Fudgets, a library of combinators for building graphical user Interfaces in the lazy functional language Haskell. The Fudget library has been used to build a number of substantial applications, including a web browser and a proof Editor Interface to a proof checker for constructive type theory. This paper develops a semantic theory for the non-deterministic stream processors that are at the heart of the Fudget concept. The interaction of two features of stream processors makes the development of such a semantic theory problematic: (i)the sharing of computation provided by the lazy evaluation mechanism of the underlying host language, and(ii)the addition of non-deterministic choice needed to handle the natural concurrency that reactive applications entail. We demonstrate that this combination of features in a higher-order functional language can be tamed to provide a tractable semantic theory and induction principles suitable for reasoning about contextual equivalence of Fudgets
-
COORDINATION - Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language
Coordinatio Languages and Models, 1999Co-Authors: Andrew Moran, David Sands, Magnus CarlssonAbstract:The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by designing a set of combinators (higher-order reusable programs) for an application area, and by constructing individual applications by combining and coordinating individual combinators. This paper is concerned with a successful example of such an embedded programming language, namely Fudgets, a library of combinators for building graphical user Interfaces in the lazy functional language Haskell. The Fudget library has been used to build a number of substantial applications, including a web browser and a proof Editor Interface to a proof checker for constructive type theory. This paper develops a semantic theory for the non-deterministic stream processors that are at the heart of the Fudget concept. The interaction of two features of stream processors makes the development of such a semantic theory problematic: (i) the sharing of computation provided by the lazy evaluation mechanism of the underlying host language, and (ii) the addition of non-deterministic choice needed to handle the natural concurrency that reactive applications entail. We demonstrate that this combination of features in a higher-order functional language can be tamed to provide a tractable semantic theory and induction principles suitable for reasoning about contextual equivalence of Fudgets.
David Sands - One of the best experts on this subject based on the ideXlab platform.
-
Erratic Fudgets: a semantic theory for an embedded coordination language
Science of Computer Programming, 2020Co-Authors: Andrew Moran, David Sands, Magnus CarlssonAbstract:AbstractThe powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by designing a set of combinators (higher-order reusable programs) for an application area, and by constructing individual applications by combining and coordinating individual combinators. This paper is concerned with a successful example of such an embedded programming language, namely Fudgets, a library of combinators for building graphical user Interfaces in the lazy functional language Haskell. The Fudget library has been used to build a number of substantial applications, including a web browser and a proof Editor Interface to a proof checker for constructive type theory. This paper develops a semantic theory for the non-deterministic stream processors that are at the heart of the Fudget concept. The interaction of two features of stream processors makes the development of such a semantic theory problematic: (i)the sharing of computation provided by the lazy evaluation mechanism of the underlying host language, and(ii)the addition of non-deterministic choice needed to handle the natural concurrency that reactive applications entail. We demonstrate that this combination of features in a higher-order functional language can be tamed to provide a tractable semantic theory and induction principles suitable for reasoning about contextual equivalence of Fudgets
-
COORDINATION - Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language
Coordinatio Languages and Models, 1999Co-Authors: Andrew Moran, David Sands, Magnus CarlssonAbstract:The powerful abstraction mechanisms of functional programming languages provide the means to develop domain-specific programming languages within the language itself. Typically, this is realised by designing a set of combinators (higher-order reusable programs) for an application area, and by constructing individual applications by combining and coordinating individual combinators. This paper is concerned with a successful example of such an embedded programming language, namely Fudgets, a library of combinators for building graphical user Interfaces in the lazy functional language Haskell. The Fudget library has been used to build a number of substantial applications, including a web browser and a proof Editor Interface to a proof checker for constructive type theory. This paper develops a semantic theory for the non-deterministic stream processors that are at the heart of the Fudget concept. The interaction of two features of stream processors makes the development of such a semantic theory problematic: (i) the sharing of computation provided by the lazy evaluation mechanism of the underlying host language, and (ii) the addition of non-deterministic choice needed to handle the natural concurrency that reactive applications entail. We demonstrate that this combination of features in a higher-order functional language can be tamed to provide a tractable semantic theory and induction principles suitable for reasoning about contextual equivalence of Fudgets.
Issei Fujishiro - One of the best experts on this subject based on the ideXlab platform.
-
aflak: Visual programming environment enabling end-to-end provenance management for the analysis of astronomical datasets
Visual Informatics, 2019Co-Authors: Malik Olivier Boussejra, Rikuo Uchiki, Yuriko Takeshima, Kazuya Matsubayashi, Shunya Takekawa, Makoto Uemura, Issei FujishiroAbstract:Abstract This paper describes an extendable graphical framework, aflak , which provides a visualization and provenance management environment for the analysis of multi-spectral astronomical datasets. Via its node Editor Interface, aflak allows the astronomer to compose transforms on input datasets queryable from public astronomical data repositories, then to export the results of the analysis as Flexible Image Transport System (FITS) files, in a manner such that the full provenance of the output data be preserved and reviewable, and that the exported file be usable by other common astronomical analysis software. FITS is the standard of data interchange in astronomy. By embedding aflak ’s provenance data into FITS files, we both achieve interoperability with existing software and full reproducibility of the process by which astronomers make discoveries.
