AISB convention 2017

  In the run up to AISB2017 convention, I've asked Joanna Bryson, from the organising team, to answer few questions about the convention and what comes with it. Mohammad Majid al-Rifaie (https://twitter.com/mohmaj) Tu...


Read More...

Harold Cohen

Harold Cohen, tireless computer art pioneer dies at 87   Harold Cohen at the Tate (1983) Aaron image in background   Harold Cohen died at 87 in his studio on 27th April 2016 in Encintias California, USA.The first time I hear...


Read More...

Dancing with Pixies?...

At TEDx Tottenham, London Mark Bishop (the former chair of the Society) demonstrates that if the ongoing EU flagship science project - the 1.6 billion dollar "Human Brain Project” - ultimately succeeds in understanding all as...


Read More...

Computerised Minds. ...

A video sponsored by the society discusses Searle's Chinese Room Argument (CRA) and the heated debates surrounding it. In this video, which is accessible to the general public and those with interest in AI, Olly's Philosophy Tube ...


Read More...

Connection Science

All individual members of The Society for the Study of Artificial Intelligence and Simulation of Behaviour have a personal subscription to the Taylor Francis journal Connection Science as part of their membership. How to Acce...


Read More...
01234

Notice

AISB opportunities Bulletin Item

Postdoctoral position on lambda-calculus / higher-order languages, FRANCE

http://frec.labri.fr/
Contact: salvati@labri.fr

Post-doctoral position: ANR project Frontiers of RECognizability (FREC), Bordeaux (France)

Summary:
Some generalizations of context-free grammars (resp. pushdown
automata) were proposed in the seventies by Aho (1968,1969). Later on, Maslov (1974,1976) defined
the infinite hierarchy of ``Higher-order pushdown automata'' which extends further the above 
notions.

The hierarchy of OI languages, defined by means of ``higher-order grammars'', based on 
lambda-calculus was introduced by Damm (1982). This hierarchy turned out to be strongly 
linked with the one defined by higher-order p.d.a. (Damma and Goerdt, 1986).

As the study of OI languages and their decidable properties require to express strong invariants 
about higher-order pushdown automata, it may be interesting to use the grammatical presentation 
of higher-order OI languages by means of lambda-terms and try to express these invariants on the 
lambda-terms directly. Indeed, doing so one can benefit from the good understanding of the models 
of simply typed lambda-calculus so as to express the invariants in a more elegant and powerful way.

Thus, the subject of this postdoc pertains to bridging the world of higher-order pushdown automata
with that of lambda-calculus. This bridging can be done with several applications in mind. A first
kind of application could be the generalisation of the result of decidability of the equality of 
deterministic context-free languages to certain higher-order grammars. It could also be the study 
of equations in the lambda-calculus etc ...

Background:
The candidate should have a strong background in theoretical computer science. In particular he/she
should have knowledge in formal language theory, automata and lambda-calculus.

Founding:
The post-doctoral position will be paid around 2090 euros, free of charges, per month.

Location: LaBRI, Bordeaux 1 university, FRANCE http://www.labri.fr/[../../jump.htm?goto=http%3A%2F%2Fwww.labri.fr%2F]

Dates:
Applications must be sent, by email, before 17/07/2011.
The Post Doctoral position would take place Sept. 1st 2011 - Aug. 31st 2012 (not strict).

More Information is on the web site:
http://frec.labri.fr/[../../jump.htm?goto=http%3A%2F%2Ffrec.labri.fr%2F]
(go to the ``news'' page)

Contact: S. Salvati, G. Snizergues.
emails: salvati@labri.fr, ges@labri.fr