Take the 2-minute tour ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

In the process of creating an AST analysis framework one of the challenges is creating good reusable functions and to avoid too much boiler-plate code. To that end catamorphisms seem like a good fit, as described here:

Catamorphisms (1-7)

Is there other interesting recursion schemes and techniques that are beneficial for AST analysis like catamorphisms?

In particular with application within the constraints of the F# programming language.

share|improve this question
3  
Paramorphisms, hylomorphisms, anamorphisms, .... Also look at some of the work by Ralf Lämmel on "Scrap your boilerplate". –  Dave Clarke Feb 25 '12 at 16:13
1  
Maybe the acronym AST is clear from context to experts. What does it mean here? (I would assume Abstract Syntax Tree). The paper "Parsing with Derivatives" might interest you. –  Vijay D Feb 26 '12 at 2:38
    
Thanks for the pointers. Yes, AST means what you think it means. –  Bent Rasmussen Feb 26 '12 at 9:46
add comment

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.