1017 search results - page 8 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
APLAS
2010
ACM
14 years 9 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
POPL
1990
ACM
15 years 1 months ago
1990
ACM
Typed -calculus is an important tool in programming language research because it provides an extensible framework for studying language features both in isolation and in their rel...
100
Voted
COORDINATION
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We propose and formalize HomeBPEL, a higher-order WSBPEL-like business process execution language where processes are firstclass values that can be stored in variables, p...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
POPL
1998
ACM
15 years 1 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...