Hanne Riis Nielson
- 1.A.V.Aho, R.Sethi, J.D.Ullman: Compilers- Principles, Techniques and Tools, Addison-Wesley (1986), Google Scholar
Digital Library
- 2.J.Backus: Can Programming be Liberated from the yon Neumann Style? A Functional Style and its Algebra of Programs, Communications of the 4CM Vo}. 2z (197s). Google ScholarDigital Library
- 3.F.Bellegarde: Rewriting Systems on FP Expressions to Reduce the Number of Sequences Yielded, Science of Computer P,'ogramrning 6 (1986). Google ScholarDigital Library
- 4.R.M.Burstall, J.Darlington: A Transformation System for Developing Recursive Programs, in Journal of the ACM 24 (1977). Google ScholarDigital Library
- 5.P.-L. Curien: Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman, London (1986). Google ScholarDigital Library
- 6.L.Damas: Type Assignment in Programming Languages, Ph.D.-thesis CST-33-85, (University of Edinburgh, Scotland, 1985).Google Scholar
- 7.A.P. Ershov: Mixed Computation: Potential Applications and Problems for Study, in Theoretical Ccmputer Science 18 (1982).Google Scholar
- 8.M.S.Feather: A System for Assisting Program Transformation, A CM Transactions on Programruing Languages and Systems 4 (1982). Google ScholarDigital Library
- 9.M.Georgeff: Transformations and reduction strategies for typed lambda expressions, A CM Transactions on Programming Languages and Systerns 6 (1984) Google ScholarDigital Library
- 10.P.G.Harrison: Linearisation: An Optimisation for Nonlinear Functional Programs, Science of Compurer Programming 10 (1988). Google ScholarDigital Library
- 11.U.J~rring, W.L.Scherlis: Compilers and Staging Transformations, in Proc. 13th A CM Symposium on Principles of Programming Languages (1986). Google ScholarDigital Library
- 12.J.Lambek, P.J.Scott: Introduction to Higher Order Categorical Logic, Cambridge Studies in Advances Mathematics 7 (1986). Google ScholarDigital Library
- 13.R.Milner: The Standard ML cote language, in Proc. 1985 A CM Conference on LISP and Functional Programming (1984).Google Scholar
- 14.R.Milner: A Theory of Type Polymorphism in Programming, in Journal of Computer Systems, Vol. 17 (i978).Google Scholar
- 15.M.Montenyohl, M.Wand: Correct flow analysis in Continuation Semantics, in Proc. 15th ACM Symposture on Principles of P~'ogramming Languages (1988). Google ScholarDigital Library
- 16.F.Nielson: Program Transformations in a Denotational Setting, A CM Transactions on Programming Languages and Systems ? (1985). Google ScholarDigital Library
- 17.H.R.Nielson, F.Nielson: Semantics Directed Compiling for Functional Languages, in Proc. 1986 A CM Conference on LISP and Functional Programming (1986). Google ScholarDigital Library
- 18.H.R.Nielson: The core ofthe PSi-system (Aalborg University Center, Report IR 87-02, 1987).Google Scholar
- 19.F.Nielson: Towards a Denotational Theory of Abstract lntepretation, in Abstract Interpretation of Declarative Languages, S.Abramsky and C.Hankin (eds.), (Ellis ltorwood, 1987).Google Scholar
- 20.F.Nielson, H.R. Nielson: Two-Level Semantics and Code Generation, Theoretical Computer Science 56 (1.988). Google ScholarDigital Library
- 21.F.Nielson: A Formal Type System for Comparing Partial Evaluators, in Partial Evaluation and Mi~ed Computation, (North-Holland, 1988).Google Scholar
- 22.H.R. Nielson, F.Nielson: Automatic Binding Time Analysis for a Typed A-calculus, Science of Compater Programming 10 (1988). Also see Proc. 15th A CM Symposium on Principles of Programming Languages (1988). Google ScholarDigital Library
- 23.F.Nielson, H.R.Niclson: 2-level A-lifting, in Proc. ESOP 1988, Lecture Notes in Computer Science 300 (Springer, 1988).Google Scholar
- 24.H.R.Nielson, F.Nielson: Functional Completeness of the Mixed A-Calculus and Combinatory Logic, Theoretical Computer Science (to appear). Google ScholarDigital Library
- 25.F.Nielson: Two-Level Semantics and Abstract Interpretation, Theoretical Computer Science -- Fundamental Studies (to appear). Google ScholarDigital Library
- 26.F.Nielson, H.R. Nielson: The TML-approach to Compilex-Compilers, ID-TR 1988-47, Department of Computer Science, Technical University of Denmark (1988).Google Scholar
- 27.D.A.Schmidt: Static Properties of Paxtial Evaluation, in Partial Evaluation and Mized Computation, (North-Holland, 1988).Google Scholar
- 28.D.Turner: A New Implementation Technique for Applicative Languages, in Software, Practice and Ezperience 9 (1979).Google Scholar
- 29.D.A.Turner: Miranda: A Non-strict Functional Language with Polymorphic Types, in Proc. Functional Programming Languages and Computer Architectures, LectuIe Notes in Computex Science 201 (Springer, 1985). Google ScholarDigital Library
Index Terms
- Transformations on higher-order functions
Recommendations
Higher-order transformations with nested concrete syntax
LDTA '11: Proceedings of the Eleventh Workshop on Language Descriptions, Tools and ApplicationsTransformations play an important role in grammar-based applications such as program generation. In this domain, the use of the concrete syntax technology is particularly beneficial as it substantially simplifies the development and maintenance of the ...
Definitional Interpreters for Higher-Order Programming Languages
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Definitional interpreters for higher-order programming languages
ACM '72: Proceedings of the ACM annual conference - Volume 2Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters which are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Comments