1.

Record Nr.

UNINA9910716778303321

Autore

Van Gosen B. S (Bradley S.), <1960->

Titolo

Reconnaissance study of the major and trace element content of bauxite deposits in the Arkansas bauxite region, Saline and Pulaski Counties, Central Arkansas / / by Bradley S. Van Gosen and LaDonna M. Choate

Pubbl/distr/stampa

Reston, Virginia : , : U.S. Department of the Interior, U.S. Geological Survey, , 2021

Descrizione fisica

1 online resource (vi, 18 pages) : color illustrations, color maps

Collana

Open-file report ; ; 2021-1073

Soggetti

Bauxite - Arkansas - Saline County

Bauxite - Arkansas - Pulaski County

Aluminum ores - Arkansas - Saline County

Aluminum ores - Arkansas - Pulaski County

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Nota di bibliografia

Includes bibliographical references (pages).



2.

Record Nr.

UNINA9910768176003321

Titolo

Typed Lambda Calculi and Applications [[electronic resource] ] : Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings / / edited by Philippe de Groote, J. Roger Hindley

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997

ISBN

3-540-68438-7

Edizione

[1st ed. 1997.]

Descrizione fisica

1 online resource (VIII, 412 p.)

Collana

Lecture Notes in Computer Science, , 0302-9743 ; ; 1210

Disciplina

511.3

Soggetti

Computers

Logic, Symbolic and mathematical

Computer logic

Computer programming

Theory of Computation

Mathematical Logic and Formal Languages

Logics and Meanings of Programs

Programming Techniques

Mathematical Logic and Foundations

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di contenuto

A ?-to-CL translation for strong normalization -- Typed intermediate languages for shape analysis -- Minimum information code in a pure functional language with data types -- Matching constraints for the Lambda Calculus of Objects -- Coinductive axiomatization of recursive type equality and subtyping -- A simple adequate categorical model for PCF -- Logical reconstruction of bi-domains -- A module calculus for pure type systems -- An inference algorithm for strictness -- Primitive recursion for higher-order abstract syntax -- Eta-expansions in dependent type theory — The calculus of constructions -- Proof nets, garbage, and computations -- Recursion from cyclic sharing: Traced monoidal categories and models of cyclic lambda calculi -- Games and weak-head reduction for classical PCF -- A type theoretical view of



Böhm-trees -- Semantic techniques for deriving coinductive characterizations of observational equivalences for ?-calculi -- Schwichtenberg-style lambda definability is undecidable -- Outermost-fair rewriting -- Pomset logic: A non-commutative extension of classical linear logic -- Computational reflection in the calculus of constructions and its application to theorem proving -- Names, equations, relations: Practical ways to reason about new -- An axiomatic system of parametricity -- Inhabitation in typed lambda-calculi (a syntactic approach) -- Weak and strong beta normalisations in typed ?-calculi.

Sommario/riassunto

This book constitutes the refereed proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, held in Nancy, France, in April 1997. The 24 revised full papers presented in the book were carefully selected from a total of 54 submissions. The book reports the main research advances achieved in the area of typed lambda calculi since the predecessor conference, held in 1995, and competently reflects the state of the art in the area.