Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Hanne Riis Nielson
Computation Sequences: A Way to Characterize Subclasses of Attribute Grammars.
DAIMI Report Series
Finiteness Conditions for Strictness Analysis
DAIMI Report Series
‹
1
2
Related publications
Attribute Grammars as a Functional Programming Paradigm
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Relating Logic Programs and Attribute Grammars
Decision Support Systems
Developmental
Arts
Information Systems
Educational Psychology
Humanities
Management
Management Information Systems
Composable Semantics Using Higher-Order Attribute Grammars
Approach to Context Computation for Implicit Context-Sensitive Graph Grammars
Computation of Substring Probabilities in Stochastic Grammars
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Circularity Testing of Attribute Grammars Requires Exponential Time: A Simpler Proof
DAIMI Report Series
Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars
Top-Down Parsing With Simultaneous Evaluation of Noncircular Attribute Grammars
Fundamenta Informaticae
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
On Lucas Sequences Computation
Int'l J. of Communications, Network and System Sciences
