3738 search results - page 435 / 748 » Parametrized Logic Programming |
155
Voted
POPL
2012
ACM
13 years 11 months ago
2012
ACM
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
243
Voted
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
198
Voted
POPL
2001
ACM
16 years 3 months ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
116
click to vote
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
165
click to vote
ARGMAS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...