Péter Diviánszky

Learn More
We are going to develop such an interactive environment, where one can incrementally carry out programmer-guided meaning-preserving program transformations in functional languages. We discuss an alternative approach to the problems of extracting and storing the syntactic and also the static semantic information in order to be flexible enough to perform the(More)
1 Summary 1.1 Substructural Functional Programming Graph rewriting is a suitable technique to implement lazy functional languages efficiently.[1] A computation in a graph rewrite system is specified by a set of graph rewrite rules that are used to rewrite a given initial graph to its final result. The intermediate graphs are called data graphs. Consider the(More)
It is hard to use properties of memory locations in functional languages. One such property is that memory locations are unique identifiers of objects, i.e., two objects are equal if they have the same memory address. I introduce a syntactic sugar called new in a pure functional language. new provides easy-to-use unique identifiers for expressions. I show(More)
  • 1