366 search results - page 6 / 74 » Model-checking higher-order functions |
113
click to vote
LISP
2008
14 years 11 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
101
click to vote
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
103
click to vote
VISUALIZATION
2005
IEEE
15 years 5 months ago
2005
IEEE
Techniques in numerical simulation such as the finite element method depend on basis functions for approximating the geometry and variation of the solution over discrete regions ...
117
click to vote
PLILP
1995
Springer
15 years 3 months ago
1995
Springer
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
104
click to vote
ASIACRYPT
2004
Springer
15 years 5 months ago
2004
Springer
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from ...