Please use this identifier to cite or link to this item:
http://artemis.cslab.ece.ntua.gr:8080/jspui/handle/123456789/16641
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Εμμανουήλ Κουκουτός | |
dc.date.accessioned | 2018-07-23T18:36:58Z | - |
dc.date.available | 2018-07-23T18:36:58Z | - |
dc.date.issued | 2013-7-15 | |
dc.date.submitted | 2013-7-12 | |
dc.identifier.uri | http://artemis-new.cslab.ece.ntua.gr:8080/jspui/handle/123456789/16641 | - |
dc.description.abstract | Since the design of Prolog, logic programming has been one of the most prominent programming paradigms. Logic programming has traditionally been first-order. However, there have been some attempts to extend it with higher-order features.A recent work by Charalambidis et al. proposes an innovative alternative to the previous attempts. Its authors define a framework, H, with a static typing discipline and an extensional semantics. Unlike previous extensional higher-order frameworks, their framework allows for uninstantiated higher-order variables. They also provide a prototype implementation, H.In this thesis, we build on this work of Charalambidis et al. to overcome two drawbacks:- H is currently incompatible with Prolog, the de-facto standard in logic programming. More specifically, simple Prolog programs which theoretically belong in the first-order subset of H are not accepted by H.- H supports no polymorphic predicates.To overcome these drawbacks, we redesign H, aiming at an implementation that could handle a higher-order proper superset of ordinary Prolog, and extend it with a polymorphic type inference system. The new framework is named polyH. Then, we propose a surface language over our framework, polyH, which is designed to be a higher-order extension of Prolog, and of which we provide a prototype implementation. | |
dc.language | English | |
dc.subject | type inference | |
dc.subject | polymorphism logic programming | |
dc.subject | higher-order programming | |
dc.subject | prolog | |
dc.title | A Higher-order Extension Of Prolog With Polymorphic Type Inference | |
dc.type | Diploma Thesis | |
dc.description.pages | 52 | |
dc.contributor.supervisor | Παπασπύρου Νικόλαος | |
dc.department | Τομέας Τεχνολογίας Πληροφορικής & Υπολογιστών | |
dc.organization | ΕΜΠ, Τμήμα Ηλεκτρολόγων Μηχανικών & Μηχανικών Υπολογιστών | |
Appears in Collections: | Διπλωματικές Εργασίες - Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
DT2013-0127.pdf | 372.76 kB | Adobe PDF | View/Open |
Items in Artemis are protected by copyright, with all rights reserved, unless otherwise indicated.