Sciweavers

258 search results - page 17 / 52
» Relational Correspondences for Lattices with Operators
Sort
View
CAISE
2005
Springer
14 years 1 months ago
A General Approach to the Generation of Conceptual Model Transformations
In data integration, a Merge operator takes as input a pair of schemas in some conceptual modelling language, together with a set of correspondences between their constructs, and p...
Nikolaos Rizopoulos, Peter McBrien
ICFP
2012
ACM
11 years 10 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
14 years 1 months ago
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
Bartek Klin
ICALP
2010
Springer
13 years 5 months ago
Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...
Angelo Montanari, Gabriele Puppis, Pietro Sala
TPHOL
2005
IEEE
14 years 1 months ago
A Design Structure for Higher Order Quotients
The quotient operation is a standard feature of set theory, where a set is partitioned into subsets by an equivalence relation. We reinterpret this idea for higher order logic, whe...
Peter V. Homeier