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 ...


Erden in AI roundtab...

On Friday 4th September, philosopher and AISB member Dr Yasemin J Erden, participated in an AI roundtable at Second Home, hosted by Index Ventures and SwiftKey.   Joining her on the panel were colleagues from academia and indu...


AISB Convention 2016

The AISB Convention is an annual conference covering the range of AI and Cognitive Science, organised by the Society for the Study of Artificial Intelligence and Simulation of Behaviour. The 2016 Convention will be held at the Uni...


Bishop and AI news

Stephen Hawking thinks computers may surpass human intelligence and take over the world. This view is based on the ideology that all aspects of human mentality will eventually be realised by a program running on a suitable compu...


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...


Al-Rifaie on BBC

AISB Committee member and Research Fellow at Goldsmiths, University of London, Dr Mohammad Majid al-Rifaie was interviewed by the BBC (in Farsi) along with his colleague Mohammad Ali Javaheri Javid on the 6 November 2014. He was a...


AISB YouTube Channel

The AISB has launched a YouTube channel: ( The channel currently holds a number of videos from the AISB 2010 Convention. Videos include the AISB round t...



AISB opportunities Bulletin Item

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

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

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 

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 ...

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.

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

Location: LaBRI, Bordeaux 1 university, FRANCE[../../jump.htm?]

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:[../../jump.htm?]
(go to the ``news'' page)

Contact: S. Salvati, G. Snizergues.