There are two well-known approaches to programming with names, binding, and
equivalence up to consistent renaming: representing names and bindings as concrete …

Nominal logic is an extension of first-order logic which provides a simple foundation for
formalizing and reasoning about abstract syntax modulo consistent renaming of bound …

Recent research has shown how boilerplate code, or repetitive code for traversing
datatypes, can be eliminated using generic programming techniques already available …

SOFTWARE VERIFICATION RESEARCH CENTRE DEPARTMENT OF COMPUTER SCIENCE
THE UNIVERSITY OF QUEENSLAND Queensland 4072 Australia TECH Page 1 SOFTWARE …

Qu-Prolog is an extension of Prolog which performs meta-level computations over object
languages, such as predicate calculi and λ-calculi, which have object-level variables, and …

For representing high level knowledge, such as the mathematical knowledge used in
interactive theorem provers and veri cation systems, it is desirable to extend Prolog's …

In many areas of computation and reasoning, the value of an expression may depend on an
implicit parameter, which may for example represent a program state, or time, or a possible …

There are two well-known approaches to programming with names, binding, and
equivalence up to consistent renaming: representing names and bindings as concrete …

To support formal reasoning in mathematical and software engineering applications, it is
desirable to have a generic prover that can be instantiated with a range of logics. This allows …

Agent based modeling and simulation (ABMS) has been applied to a number of research
areas includingeconomics, social sciences, urban planning, epidemiology etc. with …