35 search results - page 2 / 7 » Parametric higher-order abstract syntax for mechanized seman... |
JELIA
1990
Springer
13 years 9 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
IDA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
JAR
2007
13 years 5 months ago
2007
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
ISTAR
2008
13 years 7 months ago
2008
One major obstacle to requirements engineering (RE) is the growing complexity of today's systems. Such a complexity can only be fficiently by powerful abstraction mechanisms a...