The following pages link to Michael Hanus (Q293291):
Displayed 50 items.
- Strongly sequential and inductively sequential term rewriting systems (Q293294) (← links)
- Horn clause programs with polymorphic types: Semantics and resolution (Q1177936) (← links)
- Combining static and dynamic contract checking for Curry (Q1671165) (← links)
- A residualizing semantics for the partial evaluation of functional logic programs. (Q1853170) (← links)
- CurryCheck: checking properties of Curry programs (Q2409738) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- Transforming Boolean equalities into constraints (Q2628300) (← links)
- (Q2726287) (← links)
- (Q2729761) (← links)
- (Q2736364) (← links)
- (Q2763381) (← links)
- (Q2763647) (← links)
- (Q2766794) (← links)
- (Q2767032) (← links)
- Specialization of inductively sequential functional logic programs (Q2817728) (← links)
- Reduction Strategies for Declarative Programming (Q2841228) (← links)
- (Q2843603) (← links)
- (Q2844055) (← links)
- Reporting Failures in Functional Logic Programs (Q2873788) (← links)
- Declarative Processing of Semistructured Web Data (Q2909159) (← links)
- Transforming Functional Logic Programs into Monadic Functional Programs (Q3003513) (← links)
- Analysis of residuating logic programs (Q3125900) (← links)
- (Q3200537) (← links)
- Specialization of functional logic programs based on needed narrowing (Q3370571) (← links)
- (Q3372484) (← links)
- (Q3372485) (← links)
- A needed narrowing strategy (Q3457756) (← links)
- Multi-paradigm Declarative Languages (Q3608646) (← links)
- Higher-order narrowing with definitional trees (Q4256147) (← links)
- (Q4281583) (← links)
- The integration of functions into logic programming: From theory to practice (Q4305632) (← links)
- Lazy narrowing with simplification (Q4395684) (← links)
- (Q4409152) (← links)
- (Q4413065) (← links)
- Default rules for Curry (Q4593082) (← links)
- FUNCTIONAL PEARL <i>Concurrent distinct choices</i> (Q4660263) (← links)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- (Q4944888) (← links)
- From Logic to Functional Logic Programs (Q5038460) (← links)
- Higher-order narrowing with definitional trees (Q5055857) (← links)
- Logic programs with equational type specifications (Q5096188) (← links)
- Combining Static and Dynamic Contract Checking for Curry (Q5134280) (← links)
- Lazy call-by-value evaluation (Q5168933) (← links)
- Declarative Programming with Function Patterns (Q5302877) (← links)
- Improving Lazy Non-Deterministic Computations by Demand Analysis (Q5398051) (← links)
- A Virtual Machine for Functional Logic Computations (Q5423547) (← links)
- Overlapping Rules and Logic Variables in Functional Logic Programs (Q5449594) (← links)
- Run-Time Profiling of Functional Logic Programs (Q5458802) (← links)
- Logic Programming (Q5475783) (← links)
- From Boolean Equalities to Constraints (Q5743586) (← links)