✦ LIBER ✦

Adapting functional programs to higher order logic

✍ Scribed by Scott Owens; Konrad Slind

Publisher: Springer
Year: 2008
Tongue: English
Weight: 559 KB
Volume: 21
Category: Article
ISSN: 1388-3690
DOI: 10.1007/s10990-008-9038-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Learning in order to avoid search in log

Learning in order to avoid search in logic programming

✍ M.J. Pazzani 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Adapting Big-Step Semantics to Small-Ste

Adapting Big-Step Semantics to Small-Step Style: Coinductive Interpretations and “Higher-Order” Derivations

✍ Husain Ibraheem; David A. Schmidt 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 36 KB

Higher-Order Duality in Nondifferentiabl

Higher-Order Duality in Nondifferentiable Minimax Programming with Generalized Type I Functions

✍ I. Ahmad; Z. Husain; S. Sharma 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 297 KB

Reply to a note on higher order transfer

Reply to a note on higher order transfer functions

✍ G.R. Tomlinson; D.M. Storer 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Extension of the CVBEM to higher-order t

Extension of the CVBEM to higher-order trial functions

✍ T.V Hromadka II; C.C Yen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 501 KB

Higher order symmetric duality in nondif

Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions

✍ Ravi P. Agarwal; Izhar Ahmad; Anurag Jayswal 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 281 KB

A pair of Mond-Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K -F -convexity assumptions. Our results generalize several known results in the literature.