Show simple item record

dc.contributor.authorClérici Martínez, Silvia Inés
dc.contributor.authorZoltan Torres, Ana Cristina
dc.contributor.authorPrestigiacomo, Guillermo
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-05-18T08:49:33Z
dc.date.available2016-05-18T08:49:33Z
dc.date.issued2009-11-17
dc.identifier.citationClérici, S.I., Zoltan, A., Prestigiacomo, G. "Graphical and incremental type inference: a graph transformation approach". 2009.
dc.identifier.urihttp://hdl.handle.net/2117/87151
dc.description.abstractWe present a graph grammar based type inference system for a totally graphic development language. NiMo (Nets in Motion) can be seen as a graphic equivalent to Haskell that acts as an on-line tracer and debugger. Programs are process networks that evolve giving total visibility of the execution state, and can be interactively completed, changed or stored at any step. In such a context, type inference must be incremental. During the net construction or modification only type safe connections are allowed. The user visualises the type information evolution and, in case of conflict, can easily identify the causes. Though based on the same ideas, the type inference system has significant differences with its analogous in functional languages. Process types are a non-trivial generalization of functional types to handle multiple outputs, partial application in any order, and curried-uncurried coercion. Here we present the elements to model graphical inference, the notion of structural and non-structural equivalence of type graphs, and a graph unification and composition calculus for typing nets in an incremental way.
dc.format.extent15 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-09-33-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subject.otherType inference
dc.subject.otherType visualization
dc.subject.otherGraph Transformation
dc.subject.otherData visualisation
dc.subject.otherFunctional languages
dc.subject.otherGraph grammars
dc.titleGraphical and incremental type inference: a graph transformation approach
dc.typeExternal research report
dc.rights.accessOpen Access
drac.iddocument2960225
dc.description.versionPostprint (published version)
upcommons.citation.authorClérici, S.I., Zoltan, A., Prestigiacomo, G.
upcommons.citation.publishedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder