*To*: isabelle-users <isabelle-users at cl.cam.ac.uk>*Subject*: [isabelle] A problem on ML-like function programming*From*: li yongjian <lyj238 at gmail.com>*Date*: Sun, 29 Dec 2013 22:27:22 +0800*Cc*: cl-isabelle-users <cl-isabelle-users at lists.cam.ac.uk>

Dear experts: Happy new year! I have a question on analyzing the structure of a function in function language. I use FL, a function language in with reflection feature. My problem: I have a simple function definition, and want to print its structure let f x=x +1; I want to print the value f as a string follows: " f x=x + 1"; how to implement it? Of course, I want to generalize this to any function. regards! lyj

**Follow-Ups**:**Re: [isabelle] A problem on ML-like function programming***From:*Yannick Duchêne (Hibou57)

- Previous by Date: Re: [isabelle] Infinitely recursive lambda expression or not?
- Next by Date: Re: [isabelle] A problem on ML-like function programming
- Previous by Thread: Re: [isabelle] Where to learn about HOL vs FOL?
- Next by Thread: Re: [isabelle] A problem on ML-like function programming
- Cl-isabelle-users December 2013 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list