GSoC 2015

[Ezequiel Postan]

Hello, I would like to participate in GSoC 2015 and I would like to ask you a few questions.

Are you interested in someone to implement a Lambda Calculus module. Or any module related to theoretical computer science.

Is there any particular project you would like to concrete next year?

Regards

Ezequiel

[Aaron Meurer]

I'd like to see more specifics on what this module would do before
saying whether it is in-scope for SymPy or not. The guiding rule for
SymPy is if it is fundamentally symbolic, then it is probably
in-scope, but if not, then it is probably not in-scope.

Aaron Meurer

> --
> You received this message because you are subscribed to the Google Groups
> "sympy" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to sympy+un...@googlegroups.com.
> To post to this group, send email to sy...@googlegroups.com.
> Visit this group at http://groups.google.com/group/sympy.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/sympy/BAY174-W182FECFB627DAA19DAB1B599530%40phx.gbl.
> For more options, visit https://groups.google.com/d/optout.

[Ezequiel Postan]

Lambda Calculus is a model of computation, there are many theoretical interesting things to do in it.

It is a symbolic language where you can basically define constants, functions and application of functions.

The module could at first implement the classic untyped lambda calculus.

The operations that could be implemented would be:

-  solving alpha-equivalence (a notion of equality between terms)

- apply steps of beta-reduction (this can be seen as evaluation of a function). Here we can have many interesting methods like normal, eager, head-normal form, et al.

- determination of existence of normal forms of a sub-group of terms (normalization is an undecidable problem, but some sub-parts of the language have normalization guaranteed)

- beta equivalence (also undecidable problem in general case)

There are many interesting extensions that are quite big, related to type systems and logic for the future.

If you want, I can give more details about lambda calculus, so don't hesitate to ask.

On the other hand, there can be also other kind of models of computation, list functions are a Turing Complete model of computation. It is really elegant and simple but not well known. I guess automata theory and grammars could be an interesting project too.

Best Regards

Ezequiel

> To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/CAKgW%3D6K3W49HChoySm8keictsNzzrhxaXjQMFhhCRUPYhuTQZw%40mail.gmail.com.