The following pages link to Bern Martens (Q809589):
Displaying 10 items.
- Compiling bottom-up and mixed derivations into top-down executable logic programs (Q809591) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- Automatic finite unfolding using well-founded measures (Q3129508) (← links)
- (Q4217937) (← links)
- Why untyped nonground metaprogramming is not (much of) a problem (Q4327412) (← links)
- (Q4506395) (← links)
- Conjunctive partial deduction: foundations, control, algorithms, and experiments (Q4939538) (← links)
- (Q4944882) (← links)
- (Q5688889) (← links)
