Sciweavers

2076 search results - page 89 / 416
» Functional logic overloading
Sort
View
FROCOS
2005
Springer
14 years 2 months ago
Connecting Many-Sorted Structures and Theories Through Adjoint Functions
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
Franz Baader, Silvio Ghilardi
ESOP
2009
Springer
14 years 21 days ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
COR
2008
107views more  COR 2008»
13 years 9 months ago
Evolutionary functional testing
Evolutionary Testing is a promising approach for automating the testing of software-based systems. A number of papers have been published in the last years which have successfully...
Oliver Bühler, Joachim Wegener
ECAI
1998
Springer
14 years 13 days ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
CHES
2007
Springer
94views Cryptology» more  CHES 2007»
14 years 3 months ago
MAME: A Compression Function with Reduced Hardware Requirements
This paper describes a new compression function, MAME designed for hardware-oriented hash functions which can be used in applications reduced hardware requirements. MAME takes a 25...
Hirotaka Yoshida, Dai Watanabe, Katsuyuki Okeya, J...