• Publications
  • Influence
A needed narrowing strategy
Narrowing is the operational principle of languages that integrate functional and logic programming. We propose a notion of a needed narrowing step that, for inductively sequential rewrite systems,Expand
  • 334
  • 40
The Integration of Functions into Logic Programming: From Theory to Practice
  • M. Hanus
  • Computer Science
  • J. Log. Program.
  • 1 May 1994
Abstract Functional and logic programming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on theExpand
  • 514
  • 29
Curry: an integrated functional logic language (version 0
ion: A[x/τ ] ` e :: τ ′ A ` \x->e :: τ → τ ′ if τ is a type expression Existential: A[x/τ ] ` e :: τ ′ A ` let x free in e :: τ ′ if τ is a type expression Figure 1: Typing rules for Curry programsExpand
  • 249
  • 29
Xbase: implementing domain-specific languages for Java
Xtext is an open-source framework for implementing external, textual domain-specific languages (DSLs). So far, most DSLs implemented with Xtext and similar tools focus on structural aspects such asExpand
  • 96
  • 16
Curry: An Integrated Functional Logic Language
ion: A[x/τ ] ` e :: τ ′ A ` \x->e :: τ → τ ′ if τ is a type expression Existential: A[x/τ ] ` e :: Success A ` let x free in e :: Success if τ is a type expression Conditional: A ` e1 :: Bool A ` e2Expand
  • 240
  • 14
A unified computation model for functional and logic programming
We propose a new computation model which combines the operational principles of functional languages (reduction), logic languages (non-deterministic search for solutions), and integrated functionalExpand
  • 212
  • 13
Higher-Order Narrowing with Definitional Trees
Functional logic languages with a sound and complete operational semantics are mainly based on narrowing. Due to the huge search space of simple narrowing, steadily improved narrowing strategies haveExpand
  • 134
  • 10
Multi-paradigm Declarative Languages
  • M. Hanus
  • Computer Science
  • ICLP
  • 8 September 2007
Declarative programming languages advocate a programming style expressing the properties of problems and their solutions rather than how to compute individual solutions. Depending on the underlyingExpand
  • 108
  • 8
Horn Clause Programs with Polymorphic Types: Semantics and Resolution
  • M. Hanus
  • Computer Science
  • Theor. Comput. Sci.
  • 21 October 1991
This paper presents a Horn clause logic where functions and predicates are declared with polymorphic types. Types are parameterized with type variables. This leads to an ML-like polymorphic typeExpand
  • 37
  • 8
Pakcs: The portland aachen kiel curry system
  • 103
  • 7