Sciweavers

70 search results - page 5 / 14
» Focus and Higher-Order Unification
Sort
View
AGP
2010
IEEE
14 years 13 days ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
ICALP
2010
Springer
14 years 4 days ago
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi
Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
AFP
1995
Springer
126views Formal Methods» more  AFP 1995»
13 years 11 months ago
Functional Programming with Overloading and Higher-Order Polymorphism
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
Mark P. Jones
BIRTHDAY
2010
Springer
13 years 7 months ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller
JUCS
2007
80views more  JUCS 2007»
13 years 7 months ago
Higher-Order Lazy Functional Slicing
: Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is pa...
Nuno F. Rodrigues, Luís Soares Barbosa