We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
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...
— With the advent of Model-Driven Engineering (MDE) several model transformation approaches and languages have been developed in the last 5 years. Most of these existing approach...
Manuel Wimmer, Michael Strommer, Horst Kargl, Gerh...
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...