[Chicken-users] How to tell csc to call main?
Hi, How to tell csc to call main in the same way like csi -ss? $ cat distribution.scm #! /usr/bin/csi -ss (define (main args) (display main\n)) $ ./distribution.scm main $ csc distribution.scm $ ./distribution $ csc does not seem to have a -ss option. Regards, Sascha ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
Re: [Chicken-users] How to tell csc to call main?
Hi! * Sascha Ziemann cev...@gmail.com [141219 14:43]: How to tell csc to call main in the same way like csi -ss? csc does not seem to have a -ss option. Call (main) at toplevel. If you want to change the behaviour depending on whether the code is compiled or interpreted you can use cond-expand testing for feature 'compiling HTH, Christian -- May you be peaceful, may you live in safety, may you be free from suffering, and may you live with ease. ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
Re: [Chicken-users] How to tell csc to call main?
Hi, Christian Kellermann ck...@pestilenz.org writes: Call (main) at toplevel. If you want to change the behaviour depending on whether the code is compiled or interpreted you can use cond-expand testing for feature 'compiling alternatively pass an option like this to csc: -postlude '(main (command-line-arguments))' Untested but you get the idea. Actually, it would probably make sense to have an option to that effect for csc, too. Moritz signature.asc Description: PGP signature ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
[Chicken-users] [TFP 2015] 1st call for papers
- C A L L F O R P A P E R S - TFP 2015 === 16th Symposium on Trends in Functional Programming June 3-5, 2015 Inria Sophia Antipolis, France http://tfp2015.inria.fr/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below). Authors of draft papers will be invited to submit revised papers based on the feedback receive at the symposium. A post-symposium refereeing process will then select a subset of these articles for formal publication. The selected revised papers are expected to be published as a Springer Lecture Notes in Computer Science (LNCS) volume. TFP 2015 will be the main event of a pair of functional programming events. TFP 2015 will be accompanied by the International Workshop on Trends in Functional Programming in Education (TFPIE), which will take place on June 2nd. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in * Edinburgh (Scotland) in 2003; * Munich (Germany) in 2004; * Tallinn (Estonia) in 2005; * Nottingham (UK) in 2006; * New York (USA) in 2007; * Nijmegen (The Netherlands) in 2008; * Komarno (Slovakia) in 2009; * Oklahoma (USA) in 2010; * Madrid (Spain) in 2011; * St. Andrews (UK) in 2012; * Provo (Utah, USA) in 2013; * and in Soesterberg (The Netherlands) in 2014. For further general information about TFP please see the TFP homepage. (http://www.tifp.org/). == INVITED SPEAKERS == TFP is pleased to announce talks by the following two invited speakers: * Laurence Rideau is a researcher at INRIA and is interested in the semantics of programming languages , the formal methods, and the verification tools for programs and mathematical proofs. She participated in the beginnings of the Compcert project (certified compiler), and is part of the Component Mathematical team in the MSR-INRIA joint laboratory, who performed the formalization of the Feit-Thompson theorem successfully. Thirty years ago, computers barged in mathematics with the famous proof of the Four Color Theorem. Initially limited to simple calculation, their role is now expanding to the reasoning whose complexity is beyond the capabilities of most humans, as the proof of the classification of finite simple groups. We present our large collaborative adventure around the formalization of the Feit-Thompson theorem (http://en.wikipedia.org/wiki/Feit%E2%80%93Thompson_theorem) that is a first step to the classification of finite groups and that uses a palette of methods and techniques that range from formal logic to software (and mathematics) engineering. * Sam Aaron (?) == SCOPE == The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not simultaneously submitted for publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Debugging and profiling for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional
[Chicken-users] testing if a symbol has been interned
In Common Lisp, clisp specifically, you can test whether a symbol has been bound, that is interned, or not using boundp; is there a way to do this in Chicken? (boundp 'a) ; nil (defvar a 1) (boundp 'a) ; t I wrote up a function once a while back that used exception handling to check if a symbol had been defined, but if there's already an egg that provides this support or if it's built-in, I wanted to know so that I wouldn't have to bother trying to rewrite said function. -- Alexej Magura ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
Re: [Chicken-users] testing if a symbol has been interned
You could use the apropos egg to accomplish this. -Dan On Fri, Dec 19, 2014 at 10:38 PM, Alexej Magura agm2...@gmail.com wrote: In Common Lisp, clisp specifically, you can test whether a symbol has been bound, that is interned, or not using boundp; is there a way to do this in Chicken? (boundp 'a) ; nil (defvar a 1) (boundp 'a) ; t I wrote up a function once a while back that used exception handling to check if a symbol had been defined, but if there's already an egg that provides this support or if it's built-in, I wanted to know so that I wouldn't have to bother trying to rewrite said function. -- Alexej Magura ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
Re: [Chicken-users] testing if a symbol has been interned
On Dec 19, 2014, at 10:38 PM, Alexej Magura agm2...@gmail.com wrote: In Common Lisp, clisp specifically, you can test whether a symbol has been bound, that is interned, or not using boundp; is there a way to do this in Chicken? (boundp 'a) ; nil (defvar a 1) (boundp 'a) ; t I wrote up a function once a while back that used exception handling to check if a symbol had been defined, but if there's already an egg that provides this support or if it's built-in, I wanted to know so that I wouldn't have to bother trying to rewrite said function. Look at the symbol-utils egg unbound-value unbound-value? unbound? #;1 (use symbol-utils) #;2 (unbound? 'foo) #t #;3 (unbound? '+) #f -- Alexej Magura ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
Re: [Chicken-users] testing if a symbol has been interned
Relatedly, is there a tool that can describe *where* a symbol was bound? -Dan On Fri, Dec 19, 2014 at 10:45 PM, Kon Lovett konlov...@gmail.com wrote: On Dec 19, 2014, at 10:38 PM, Alexej Magura agm2...@gmail.com wrote: In Common Lisp, clisp specifically, you can test whether a symbol has been bound, that is interned, or not using boundp; is there a way to do this in Chicken? (boundp 'a) ; nil (defvar a 1) (boundp 'a) ; t I wrote up a function once a while back that used exception handling to check if a symbol had been defined, but if there's already an egg that provides this support or if it's built-in, I wanted to know so that I wouldn't have to bother trying to rewrite said function. Look at the symbol-utils egg unbound-value unbound-value? unbound? #;1 (use symbol-utils) #;2 (unbound? 'foo) #t #;3 (unbound? '+) #f -- Alexej Magura ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
Re: [Chicken-users] testing if a symbol has been interned
Thanks, Kon. On 12/19/2014 11:45 PM, Kon Lovett wrote: On Dec 19, 2014, at 10:38 PM, Alexej Magura agm2...@gmail.com mailto:agm2...@gmail.com wrote: In Common Lisp, clisp specifically, you can test whether a symbol has been bound, that is interned, or not using boundp; is there a way to do this in Chicken? (boundp 'a) ; nil (defvar a 1) (boundp 'a) ; t I wrote up a function once a while back that used exception handling to check if a symbol had been defined, but if there's already an egg that provides this support or if it's built-in, I wanted to know so that I wouldn't have to bother trying to rewrite said function. Look at the symbol-utils egg unbound-value unbound-value? unbound? #;1 (use symbol-utils) #;2 (unbound? 'foo) #t #;3 (unbound? '+) #f -- Alexej Magura ___ Chicken-users mailing list Chicken-users@nongnu.org mailto:Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users -- Alexej Magura ___ Chicken-users mailing list Chicken-users@nongnu.org https://lists.nongnu.org/mailman/listinfo/chicken-users
