Online Store

Geometry.Net - the online learning center
Home  - Lambda_Calculus - Bohm Trees
Page 1     1-45 of 45    1 

1. Barendregt: Lambda Calculus
The Scott topology can be translated to Bohm Trees associated with terms. We have the upside down ChurchRosser Theorem for eta on Bohm-Trees.
The Omega Group TPS A higher-order theorem proving system This page was created and is maintained by Chad E Brown
Barendregt, H. P. The Lambda Calculus: Its Syntax and Semantics. North Holland, Amsterdam (1984).
Part I: TOWARDS THE THEORY Chapter 1: Introduction. Chapter 2: Conversion. Chapter 3: Reduction. Chapter 4: Theories. ... Chapter 5: Models. Part II: CONVERSION Chapter 6: Classical Lambda Calculus. Chapter 7: The Theory of Combinators. Chapter 8: Classical Lambda Calculus (Continued) Chapter 10: Bohm Trees. Part III: REDUCTION Chapter 11: Fundamental Theorems. Chapter 13: Reduction Strategies. Appendix A: Typed Lambda Calculus. Part I: TOWARDS THE THEORY Chapter 1: Introduction. Lambda calculus is a theory of functions as rules instead of graphs. The objects of study (type free lambda terms) can be used as both function and argument. Lambda calculus was originally invented to provide a general theory of functions which could be extended to provide a foundation for mathematics. Church's original system [1932/33] was inconsistent due to the Kleene-Rosser paradox [1935]. One response by Church [1941] was to study the subsystem given by the lambda-I calculus. [Another response was to study a system based on typed lambda calculus.] Curry proposed to extend pure combinatory logic by illative notions to give a foundation for mathematics. This program has not been completed. Another foundational approach related to lambda calculus is Feferman's [1975/80] systems for constructive mathematics based on partial application. These systems are related to Wagner [1969] and Strong's [1968] Uniformly Reflexive Structures. Also, there are relationships between typed lambda calculus, proof theory and category theory.

2. JSTOR Degrees Of Sensible Lambda Theories
Bohm Trees. Let M be a Aterm. The Bohm tree of M, BT(M), is defined as follows. If M is unsolvable, then BT(M)= f/(f~ is just some symbol).<45:DOSLT>2.0.CO;2-6

Keywords Linear lambda calculus, abstract Bohm Trees, term assignment systems, uniform provability. We present the spine calculus S -o T as an efficient
Computer Science Department
School of Computer Science, Carnegie Mellon University
CMU-CS-97-125 A Linear Spine Calculus Iliano Cervesato, Frank Pfenning April 1997
Keywords: Linear lambda calculus, abstract Bohm trees, term assignment systems, uniform provability
We present the spine calculus S as an efficient representation for the linear lambda-calculus lambda which includes intuitionistic functions (->), linear functions - o T . S enhances the representation of Church's simply typed lambda-calculus as abstract Bohm trees by enforcing extensionality and by incorporating linear constructs. This approach permits procedures such as unification to retain the efficient head access that characterizes first-order term languages without the overhead of performing n -conversions at run time. Potential applications lie in proof search, logic programming, and logical frameworks based on linear type theories. We define the spine calculus, give translations of lambda into S and vice-versa, prove their soundness and completeness with respect to typing and reductions, and show that the spine calculus is strongly normalizing and admits unique canonical forms. 36 pages

4. Publications Intersection Types For Lambda-Trees
We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating lambdaterms (Bohm Trees,
We introduce a type assignment system which is parametric with respect to five families of trees obtained by evaluating lambda-terms (Bohm trees, Levy-Longo trees, ...). Then we prove, in an (almost) uniform way, that each type assignment system fully describes the observational equivalences induced by the corresponding tree representation of terms. More precisely, for each family of trees, two terms have the same tree if and only if they get assigned the same types in the corresponding type assignment system.

5. Abstracts Of The Lectures At The School In Logic And Computation
Bohm Trees, Bohm Trees modulo finite or infinite etaexpansions. In this talk, we will focus on the relations between the tree representations of the

Nondeterministic Bohm Trees * Barry Jay Typing the pattern calculus * Barry Jay Quantifying the benefits of sub-typing * Nao Hirokawa and Aart Middeldorp'06---CALL-FOR-PARTICIPATION-td5489716.html
Nabble.setVar("skin",null); = 'forum.TopicDump'; Nabble.addCssRule(document.styleSheets[0],'.nabble a:link','color:'+document.linkColor); Nabble.addCssRule(document.styleSheets[0],'.nabble a:visited','color:'+document.vlinkColor); Nabble Programming Languages UIUC Maude Nabble.userHeader(14115);
View: Threaded Chronologically All Messages Nabble.selectOption(Nabble.get("nabble.viewSelect"),Nabble.tview); New views Rating Filter: Alert me
document.write(Nabble.ratingStars(3)); by document.write(''); Azadeh Farzan document.write(''); document.write(Nabble.formatDateLong(new Date(1153848259000))); :: Rate this Message: Reply to Author View Threaded Show Only this Message
3rd International Workshop on Higher-Order Rewriting
Tuesday August 15, 2006

The aim of HOR is to provide an informal and friendly setting to discuss
recent work and work in progress concerning higher-order rewriting.

7. Domains And Lambda Calculi (book Announcement)
6.5 Towards sequentiality 6.6 PCF Bohm Trees 7 Domain equations 7.1 Domain equations 7.2 Predicate equations 7.3 Universal domains 7.4 Representation 8
[Prev] [Next] [Index] [Thread]
Domains and Lambda Calculi (book announcement)
Book announcement: DOMAINS AND LAMBDA CALCULI by Roberto AMADIO and Pierre-Louis CURIEN Cambridge Tracts in Theoretical Computer Science 46, ISBN 0-521-62277-8, Cambridge University Press We are pleased to announce that the book is now available. Order informations can be found at and for North-America at

8. MOVES: Software Modeling And Verification (Info 2)
of meaninglessness genericity of the class of meaningless terms, the consistency of equating all meaningless terms, and the construction of Bohm Trees.

9. Concurrency Þ Non-deterministism
For instance, Dave Sands and others use them for equivalence of Bohm Trees in the lambdacalculus (which I never understood!!).
Planche 1 Concurrency 2
Functions vs Processes
Jean-Jacques Lévy

Planche 2
Concurrency Non-deterministism
Suppose x is a global variable. At beginning, x
P x x x x x x
after P , then x may have several values ( x
Hence P is not a function from memory states to memory states.
In concurrent programming, execution is not deterministic since it is upto an external agent (the scheduler). Let S Values be the set of memory states. Let [[ P ]] be the meaning of P A concurrent program is not a (partial) function from memory states to memory states. [[ P S S A concurrent program is a relation on memory states. [[ P S S Planche 3
Concurrency Interaction
Consider P x Q x x x P and Q are same functions on memory states: s s x However after P P , then x after P Q , then x A semantic (meaning) is compositional iff [[ P Q ]] implies [[ C P C Q ] ]] for any context C In previous example, in any compositional semantics, [[ P Q Conclusion P and Q are not equivalent processes. Planche 4
Concurrency Termination
Concurrent processes are often non terminating An operating system never terminates; same for the software of a vending machine, or a traffic-light controler, or a human, etc.

10. An Analysis Of Multivalued And Join Dependencies Based On The
Systems and Computer Science , year = 1994, key = Bohm Trees for the Lazy Lambda Calculus with constants , number = Technical Report TRA8/94 }
An analysis of multivalued and join dependencies based on the entity-relationship approach T W Ling Proceedings of the inter department seminar on local area networks C K Yuen, et al. Integrity constraint checking in deductive databases using the prolog not-predicate T K Ling Self-assessment test on the fundamentals of data communications K Ranai, A L Ananda, A D Narasimhalu An application of prolog in chinese text processing Teh Hoon Heng, Chan Sing Chai, Yu Wellington Chia-Peir, Low Hwee Boon A system translator for chinese information processing systems H R Hwa, P Chen, L Ye A space searching method for checking the consistencey and completeness of a rulebase W W Tsang, Y S Wan, E L Lim and W Hioe A normal form for not-necessarily normalized relations Tok Wang Ling A neglected aspect of digital signatures Wai Wan Tsang and John W. John Time delays in data flow designs Kenneth C L Seah and John C McCallum A simulation game administration system Gee Kin Yeo and Boon Wei Chew Proceedings of the seminar on current trends in mis research G B Davis G.A.M.E.: a perception measurement tool for software development

11. RTA 2003 - Abstracts Of Accepted Papers
In this paper, we define a tree logic that directly embeds XML Schema as a plain subset . sets S of values (such as headnormal forms or Bohm-Trees).
Home page







VENUE Valencia Registration Accomodation Travelling ... Internet RTA'03 14th International Conference on Rewriting Techniques and Applications Valencia, Spain, June 9-11, 2003 ABSTRACTS OF REGULAR PAPERS ACCEPTED FOR PRESENTATION
    Rewriting Modulo in Deduction Modulo F. Blanqui Validation of the JavaCard Platform with Implicit Induction Techniques G. Barthe (INRIA Sophia-Antipolis, France) S. Stratulat XML Schema, Tree Logic and Sheaves Automata S. Dal Zilio (CNRS, Marseille, France) D. Lugiez Termination of String Rewriting Rules That Have One Pair of Overlaps A. Geser (National Institute of Aerospace, Hampton, USA) This paper presents a partial solution to the long standing open problem of termination of one-rule string rewriting. Overlaps between the two sides of the rule play a central role in existing termination criteria. We characterize termination of all one-rule string rewriting systems that have one such overlap at either end. This both completes a result of Kurth and generalizes a result of Shikishima-Tsuji et al. New decidability results for fragments of first order logic and application to cryptographic protocols H. Comon-Lundh

12. Abstract Böhm Trees
We present a formalism of Trees with pointers, called abstract Böhm Trees, that provide a suitable abstract framework in which various cutfree proofs or

13. [DGL+98] Intersection Types, Lambda-models And Böhm Trees
Title, « Intersection Types, Lambdamodels and Böhm Trees ». In, MSJ-Memoir Vol. 2 ``Theories of Types and Proofs . Volume, 2. Page(s), 45-97
Chronological Overview Type-Hierarchical Overview Semantics and Logics of Computation
(Most of the papers antecedent to 1995
are not included in the list) FRAMES NO FRAME Dezani-Giovannetti-deLiguoro:Tokyo98 (In a collection)
Author(s) Mariangiola Dezani-Ciancaglini, Elio Giovannetti and Ugo de' Liguoro Title In MSJ-Memoir Vol. 2 ``Theories of Types and Proofs'' Volume Page(s) Year Publisher Mathematical Society of Japan URL BibTeX code
Chronological Overview
Type-Hierarchical Overview Semantics and Logics of Computation
(Most of the papers antecedent to 1995
are not included in the list) FRAMES NO FRAME
This document was generated by
(Modified by Luca Paolini, under the GNU General Public License

14. IngentaConnect Bisimulation In Untyped Lambda Calculus - Bohm Trees And Bisimula
On the basis of an operational bisimulation account of Bohm tree equivalence, a novel operationallybased development of the Bohm tree theory is presented,
var tcdacmd="dt";

15. Publications Of Fer-Jan De Vries
We prove that the only continuous parametric Trees are Böhm and LévyLongo Trees. . Böhm Trees, bisimulations and observations in lambda calculus.
computer science
Publications of Fer-Jan de Vries
Refereed Publications
  • J.R. Kennaway, M.R. Sleep P. Severi and F.J. de Vries.
    Infinite rewriting: from syntax to semantics,
    in proceedings of Processes, Terms and Cycles: Steps on the Road to Infinity: Essays dedicated to Jan Willem Klop on the Occasion of His 60th Birthday , editors: A. Middeldorp, V. van Oostrom, F. van Raamsdonk and R. de Vrijer. SLNCS 3838, pages 148-172, 2005.
    P. Severi and F.J. de Vries.
    Separability of infinite lambda terms
    in proceedings of the LCTTNL Workshop: The second workshop on Lambda Calculus, Type Theory and Natural Language, King's College London, 12th September 2005. Page 1-12.
    and pdf Abstract P. Severi and F.J. de Vries.
    Order Structures on Böhm-like Models
    Conference paper in Luke Ong, editor, Computer Science Logic: 19th International Workshop, CSL 2005 , 14th Annual Conference of the EACSL, Oxford, UK. August 22-25, 2005. (Lecture Notes in Computer Science 3634), Springer-Verlag. Page 103-116. 2005.
  • 16. TOPPS Bibliography
    Keywords normalization by evaluation, untyped lambdacalculus, denotational semantics, functional programming, Böhm Trees, computational adequacy
    TOPPS Bibliography
    List of DIKU TOPPS publications for 2005 (alphabetic on first authors last name):
    • D-536
      O Barais, J Lawall , A-F Le Meur, and L Duchien
      Providing Support for Safe Software Architecture Transformations
      In Working session of the 5th IEEE/IFIP Working Conference on Software Architecture (WICSA 5) , page 2. Pittsburgh, Pennsylvania. November, 2005. Summary : This paper presents some issues that confront the software developer when extending a software architecture, and briefly describes some of the features of a software architecture extension framework, TranSAT, that addresses these issues. Pointers BibTeX pdf D-533
      J-P Bodeveix, M Filali, J L Lawall , and G Muller
      Applying the B formal method to the Bossa domain-specific language
      In The 17th Nordic Workshop on Programming Theory (NWPT'05) , pp. 35-38. Volume of . Copenhagen, Denmark. October, 2005. Keywords : process scheduling, domain-specific languages, formal methods, operating systems Summary Pointers BibTeX pdf D-534
      J-P Bodeveix, M Filali, J Lawall , and G Muller
      Formal methods meet Domain Specific Languages
      In Fifth International Conference on Integrated Formal Methods , pp. 187-206. Volume 3771 of Lecture Notes in Computer Science. Eindhoven, The Netherlands. November, 2005.

    17. Researchers In Intersection Types And Related Systems
    filter models, principality, union types, relevant logic, callby-value, subtyping, nondeterminism, approximants, Böhm Trees, combinatory logic,
    Researchers in Intersection Types and Related Systems
    Samson Abramsky - Oxford University Computing Laboratory
    (with Jensen (POPL '91), with Burn and Hankin (SCP '86)?)
    Alex Aiken - University of California at Berkeley
    program analysis, constraints, soft typing, union types, conditional types
    Yohji Akama
    normalization (?), combinators (?), ?
    Fabio Alessi - Università di Udine
    (MFCS '91 with Barbanera)
    Sandra Alves
    Roberto M. Amadio - Université Paris 7
    survey, ?
    Torben Amtoft - Kansas State University
    correspondence with flow analysis frameworks
    Steffen van Bakel - Imperial College
    Currified TRSs, filter models, approximation models, type inference, relevant logic, call-by-value, normalization, combinators, approximants, expansion, finite-rank restriction, universal quantifiers, unification, type inference
    Anindya Banerjee - Kansas State University
    polyvariant flow analysis, finite-rank restriction
    Franco Barbanera - Università di Catania
    expansion, finite-rank restriction, universal quantifiers, union types, unification, type inference, subtyping, approximants, Böhm trees, filter models
    Henk Barendregt - Radboud Universiteit Nijmegen
    filter models, ?

    18. Bibliography
    32, P.L. Curien, H. Herbelin, ``Computing with Abstract Böhm Trees , 49, G. Huet, H. Laulhère, ``Finite-state Transducers as Regular Böhm Trees ,

    19. Fundamenta Informaticae Vol. 45 Abstracts
    This technique is used to give a direct proof of the theorem of Hyland and Wadsworth two lterms that have the same Böhm Trees, up to (possibly infinite)
  • Preface Pawe³ Urzyczyn and Jean-Ives Girard Elementary Complexity and Geometry of Interaction Patrick Baillot and Marco Pedicini We introduce a geometry of interaction model given by an algebra of clauses equipped with resolution (following [10]) into which proofs of Elementary Linear Logic can be interpreted. In order to extend geometry of interaction computation (the so called execution formula ) to a wider class of programs in the algebra than just those coming from proofs, we define a variant of execution (called weak execution ). Its application to any program of clauses is shown to terminate with a bound on the number of steps which is elementary in the size of the program. We establish that weak execution coincides with standard execution on programs coming from proofs. Counting a Type's (Principal) Inhabitants Sabine Broda and Luís Damas We present a Counting Algorithm that computes the number of l-terms in b-normal form that have a given type t as a principal type and produces a list of these terms. The design of the algorithm follows the lines of Ben-Yelles' algorithm for counting normal (not necessarily principal) inhabitants of a type t. Furthermore, we show that one can use similar algorithms with adequate limits to count normal and principal normal inhabitants in the lI-calculus.
  • 20. DBLP Gérard P. Huet
    WCRE 2001 127135. 1998. 35, Gérard P. Huet Regular Böhm Trees. 34, Gérard P. Huet, Henri Laulhère Finite-State Transducers as Regular Böhm Trees.

    21. Bienvenue Sur Ma Page Personnelle
    I develop a technic to compute with Böhm Trees. This gives a proof of R.Kerth s conjecture on unsolvable terms. This also gives a syntactical proof of
    In my office Outside my office
    Informations diverses

    "Peut-on avoir confiance en l'informatique ?"
    Publications (enseignement)
    • R. David, K. Nour et C. Raffalli
    • Une version courte est parue dans la
      We describe our experience of using PhoX (the prover of C Raffalli) with undergraduate students in mathematics.
    • rmc
    • During the 2002-03 academic year, I used PhoX (the prover of C Raffalli) with the undergraduate students in mathematics (in

    22. Research
    Böhm Trees. I still hope to make use of a coinductive understanding of Böhm Trees. Up to now, Klaus Aehlig and me just came up with yet another presentation
    Position Currently, I am a freelance researcher in the working group of Prof. Helmut Schwichtenberg , who also supervised my doctoral thesis Reduction properties of permutative introduction elimination (PIE)-Systems. The latter was finished in 12/01 and is now published, but also available from the page of publications. Research interests Most of my work has been dedicated to the lambda-calculus or at least term systems which look like it.
    • Strong normalization proofs. Ralph Matthes and I (re-)invented a very short and easily implementable normalization proof for the simply typed lambda-calculus and showed how to extend it to permutative conversions and Gödel’s T. The crucial point is an inductive characterization SN of the set of strongly normalizing terms. Details can be found in an AML paper Eta-expansion . I thought a bit about the problems arising from eta-expansions in more complex lambda-calculi like the calculus of constructions, starting from a very elementary proof of strong normalization and confluence for eta-expansion in the simply typed lambda-calculus. As a result emerged a proof of strong normalization of combined beta-etaexp-reduction (restricted as Barthe did, not quite so harshly as

    23. Bibliography Of Hugo Herbelin
    Computing with Abstract Böhm Trees , with PierreLouis Curien, Proceedings of FLOPS 98 (bibtex Keywords Game Models, Abstract Machines, Böhm Trees.
    Research articles
    "An approach to call-by-name delimited continuations" ACM for your personal use - not for redistribution) errata bibtex entry
    Abstract: It has been shown by Saurin that de Groote's variant of Parigot's lambda-mu-calculus is strictly more expressive in the untyped case than Parigot's original calculus. We show that this additional expressivity exactly corresponds to adding delimited control so that de Groote's calculus can be seen as the exact call-by-name counterpart of Danvy and Filinski's shift-reset calculus. This "duality" is expressed in the lambda-mu-tp-hat-calculus which is lambda-mu-calculus equipped with a single dynamically-bound continuation variable denoting a resettable toplevel. An equational correspondence having already been proved in A type-theoretic foundation of delimited continuations for call-by-value lambda-mu-tp-hat and Danvy and Filinski's calculus, we simply show here the equivalence between call-by-name lambda-mu-tp-hat and de Groote's calculus. We continue with a comparative study of the operational semantics, continuation-passing-style semantics, and simple typing of both call-by-name and call-by-value versions. Finally, we show the existence of two other canonical calculus of delimited continuations. The first one morally forms an equational correspondance with Sabry's shift/lazy-reset calculus while the second one is a "lazy" version of de Groote's calculus.
    "Control Reduction Theories: the Benefit of Structural Substitution",

    24. The Sensible Graph Theories Of Lambda Calculus
    This result is a consequence of the fact that all the equations between solvable terms, which have different Böhm Trees, fail in every sensible graph
    var sc_project=2763585; var sc_invisible=0; var sc_partition=28; var sc_security="3c678009"; var addtoLayout=0; var addtoMethod=0; var AddURL = escape(document.location.href); // this is the page's URL var AddTitle = escape(document.title); // this is the page title Advanced Search CS Search Google Search

    25. HER MAJESTY'S THEATRE.; Programme For The Opening Of Beer-bohm Tree's ... - Arti
    Programme for the Opening of BeerBohm Tree s New House. LONDON, April 24. BeerBohm Tree has had over 10000 applications for seats for the opening night

    26. Readings: Theory Of Computation
    Böhm Trees Part III. Reduction 11. Fundamental Theorems 12. Strongly Equivalent Reductions 13. Reduction Strategies 14. Labelled Reduction
    Miser Project Readings
    Theory of Computation
    L ast updated 2003-02-10-22:35 -0800 (pst)
    see also
    Readings in Logic
    Readings in Mathematics
    Readings in Philosophy
    Barendregt, Hendrik Pieter. The Lambda Calculus: Its Syntax and Semantics . North-Holland (Amsterdam, 1981). ISBN 0-444-85490-8. Studies in Logic and the Foundations of Mathematics, vol. 103.
    This is one of my fundamental sources on the lambda calculus. I want to pay particular attention to combinatory logic (CL) and combinatory algebra (CA). My notes on this book focus on that.
    Part I. Towards the Theory
    1. Introduction
    2. Conversion
    3. Reduction
    4. Theories 5. Models Part II. Conversion 6. Classical Lambda Calculus 7. The Theory of Combinators 8. Classical Lambda Calculus (continued) I -Calculus Part III.

    27. The Little Calculist: Freshness... With Respect
    Now, I wonder about infinite programs like Böhm Trees. Although I don t know if they actually only use a finite number of names even though the term is
    The Little Calculist
    Dave Herman's research blog.
    Thursday, May 19, 2005
    Freshness... with respect
    In A New Approach to Abstract Syntax with Variable Binding , Pitts and Gabbay describe a "freshness" quantifier for their variant of set theory, where you can quantify over fresh names. This allows you to describe freshness conditions in a more formal way than the usual " x does not occur in M ," and even reason about fresh names with formal logic. The quantification N x can be read: "for fresh x ..." This has a cool, dual universal/existential property: because the ambient universe of names is infinite, it's always true that there exists a fresh x , and because we don't care which one we choose, any proposition we prove using the freshness quantifier holds for all such fresh names.
    What confused me for a while was that the quantifier just says " x is fresh;" it doesn't say " x is fresh with respect to M ". But it seemed like if you take a name that's fresh at one point, but then use it in another context, you might have accidentally picked a name that conflicted with a name in the new context. In other words, I was concerned that having a local freshness condition without talking globally about all the names you're ever going to use doesn't carry enough information to avoid an incorrect choice of fresh name.

    28. EULER Record Details
    \par Contents \par $\ell$Representable Functions Over Free Structures Revisited (M. Takahashi); Computing with Abstract Böhm Trees (P.-L. Curien and H.

    29. The Lambda Calculus - Elsevier
    Classical Lambda Calculus (Continued). The LambdaCalculus. Böhm Trees. Reduction. Fundamental Theorems. Strongly Equivalent Reductions.

    30. DoCIS Search Result
    Abstract Böhm Trees Hierarchical Spatial Data Structures .. Spanning Tree Representations of Graphs and Orders in Conceptual Structures

    31. This Document Was Made By OCR From A Scan Of The Technical Report
    Proof The stability theorem follows from the stability of Böhm Trees Ber78. Here we sketch a simple, alternative proof.
    This document was made by OCR from a scan of the technical report. It has not been edited or proofread and is not meant for human consumption, but only for search engines. To see the scanned original, replace OCR.htm with Abstract.htm or Abstract.html in the URL that got you here.
    Analysis and Caching of Dependencies Martin Abadi Butler Lampson Jean-Jacques L u evy Digital Systems Research Center Microsoft INRIA Rocquencourt rna@pa . dec. corn blarnpson@rnicrosoft. corn Jean
    Abstract We address the problem of dependency analysis and caching in the context of the A-calculus. The dependencies of a A- term are (roughly) the parts of the A-term that contribute to the result of evaluating it. We introduce a mechanism for keeping track of dependencies, and discuss how to use these dependencies in caching. 1 Introduction Suppose that we have evaluated the function application I(1, 2), and that its result is 7. If we cache the equality I(1,2) = 7, we may save ourselves the work of evaluating I(1, 2) in the future. Suppose further that, in the course of evaluating I(1,2), we noticed that the first argument of I

    32. Search Results For "TACS" – FacetedDBLP
    1, Gérard P. Huet, Henri Laulhère, FiniteState Transducers as Regular Böhm Trees. Search with DBLP WebCrawler Search on Bibsonomy

    33. Information And Computation, 2002; 178 (1)
    Intersection and Singleton Type Assignment Characterizing Finite BöhmTrees / Kurata, Toshihiko, 1-11. Linear Time and the Power of One First-Order
    Sumario Título / Autor(es) Página(s) Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees / Kurata, Toshihiko Linear Time and the Power of One First-Order Universal Quantifier / Durand, Arnaud Prelogical Relations / Honsell, Furio Sannella, Donald The Box Algebra=Petri Nets+Process Expressions / Best, Eike Devillers, Raymond Koutny, Maciej Relative Undecidability in Term Rewriting / Geser, Alfons Middeldorp, Aart Ohlebusch, Enno Zantema, Hans Relative Undecidability in Term Rewriting / Geser, Alfons Middeldorp, Aart Ohlebusch, Enno Zantema, Hans Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions / Neergaard, Peter Moller Sorensen, Morten Heine Ordered SOS Process Languages for Branching and Eager Bisimulations / Ulidowski, Irek Phillips, Iain Learning Closed Horn Expressions / Arias, Marta Khardon, Roni On Complexity of Easy Predictable Sequences / Vyugin, Michael V V'yugin, Vladimir V The Complexity of Solving Equations over Finite Groups / Goldmann, Mikael Russell, Alexander On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs / Bollig, Beate

    34. Infinity Symposium - The Infinity Project
    To give semantics to a term graph rewrite system, we can use a generalization of the Böhm tree called Böhm semantics. Proving that a particular Böhm
    Infinity Symposium
    From The Infinity Project
    A past event: the spring symposium for our BRICKS project INFINITY
    INFINITY SYMPOSIUM Tuesday March 21 and Wednesday March 22, 2006 Room S111, Faculty of Sciences, Vrije Universiteit Amsterdam
    The project is concerned with infinite objects, computation, modeling, and reasoning (more information can be found here ). For participants of the INFINITY project, the symposium is meant as an opportunity to learn about related work and meet people working in related fields. Most talks will be of a tutorial nature. The symposium takes place in between two PhD defenses (see Past events ) that both have to do with the subject of INFINITY
    Tuesday March 21, 2006
    Wednesday March 22, 2006

    35. Anthony Dekker - Publications List
    Dekker, A.H. The Lazy Lambda Calculus with Constants A Böhm Tree Model (Extended Abstract). In Proceedings of Computing the Australian Theory Seminar,
    Anthony Dekker : Publications List
    These are my work-related publications to date. Please email me at dekker for information on any of these publications. Unfortunately only some of these publications are available electronically at present. My Erdös Number is currently 5. For Google Scholar citations, the first few of these are mine.
    • Dekker, A.H. Experiments in Planning and the “ISLAND MISSION” Game. Submitted to SimTecT 2008
    • Dekker, A.H. Centrality in Social Networks: Theoretical and Simulation Approaches. Submitted to SimTecT 2008
    • Dekker, A.H. Network Effects in Epidemiology. Submitted to SimTecT 2008
    • Dekker, A.H. Realistic Social Networks for Simulation using Network Rewiring. To appear at MODSIM 2007 (R)
    • Dekker, A.H. Predicting Periodic Phenomena with Self-Organising Maps. To appear at MODSIM 2007 (R)
    • Dekker, A.H. Studying Organisational Topology with Simple Computational Models. Journal of Artificial Societies and Social Simulation , vol. 10, no. 4, available electronically (R)
      • Additional information for this paper is available here
    • Dekker, A.H.

    36. FLoC '02 - DOMAIN Sunday July 21st
    We do so by constructing an infinitary lambda calculus which not only has the confluence property, but also is normalising every term has its Böhm tree
    DOMAIN on Sunday Detailed program
    Sunday July 21st, 2002
    See also the unified by-slot program
    All sessions take place in auditorium 3.
    Session 5
    Bill Lawvere, State U of New York-Buffalo, USA
    Invited talk: Some open problems concerning cartesian closed categories
    Dana Scott showed in 1970 that there are many cartesian closed categories containing arbitrarily large objects which are isomorphic to their own self-exponential. Tarski's high school identities suggest a more general question:
    (1) Which exponential rigs can be objectively realized?
    Hurewicz's homotopy category is also cartesian-closed, but has the unusual property that its points functor is the left adjoint of its own left adjoint.
    (2) Can any CCC be mapped to one with that property?
    That property also applies to infinitesimals which moreover enjoy further right adjoints, so that functionals (such as differential forms) are actually functions with a bigger codomain.
    (3) Can the lambda-calculus be expanded so as to provide an efficient means of presenting CCC's with such additional right adjoints? A topos has exponential types as a consequence of the power types. The power types also permit, via Dedekind's infinite intersection method, the construction of a "natural" number object given only the geometrical phenomenon of a monomorphic endo-map which is not an isomorphism.

    Page 1     1-45 of 45    1