1.

Record Nr.

UNINA9910456723403321

Autore

Cheney George

Titolo

Just a Job? [[electronic resource] ] : Communication, Ethics, and Professional Life

Pubbl/distr/stampa

Oxford, : Oxford University Press, USA, 2009

ISBN

0-19-988468-4

1-282-34634-2

9786612346347

0-19-972038-X

Descrizione fisica

1 online resource (309 p.)

Disciplina

174

174.4

Soggetti

Occupations

Professional ethics

Success

Electronic books.

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di contenuto

Contents; Introduction; 1 (Re)Framing Ethics at Work; 2 Starting Conversations about Professional Ethics; 3 Working for a Good Life; 4 Being a Professional: Problems and Promises; 5 Reconsidering Organizations as Cultures of Integrity; 6 Seeking Something More in the Market; 7 Finding New Ways to Talk about Everyday Ethics; References; Index

Sommario/riassunto

From cartoons to boardrooms comes the statement, ""It's not personal. It's just business."" Just a Job? Communication, Ethics, and Professional Life offers a provocative perspective on ethics at work. The book questions the notions that doing ethics at work has to be work, and that work is somehow a sphere where a different set of rules applies. This problematic line between work and life runs through the ways we commonly talk about ethics, from our personal relationships to the domains of work, including the organization, the profession, and the market. Talk about ethics is far more than ""ju



2.

Record Nr.

UNINA9910144922303321

Titolo

Rewriting Techniques and Applications [[electronic resource] ] : 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997. Proceedings / / edited by Hubert Comon

Pubbl/distr/stampa

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

ISBN

3-540-69051-4

Edizione

[1st ed. 1997.]

Descrizione fisica

1 online resource (XII, 348 p.)

Collana

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

Disciplina

005.13/1

Soggetti

Programming languages (Electronic computers)

Computer logic

Logic, Symbolic and mathematical

Computer science—Mathematics

Artificial intelligence

Programming Languages, Compilers, Interpreters

Logics and Meanings of Programs

Mathematical Logic and Formal Languages

Symbolic and Algebraic Manipulation

Artificial Intelligence

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di contenuto

Well-behaved search and the Robbins problem -- Goal-Directed Completion using SOUR Graphs -- Shostak's congruence closure as completion -- Conditional equational specifications of data types with partial operations for inductive theorem proving -- Cross-sections for finitely presented monoids with decidable word problems -- New undecidability results for finitely presented monoids -- On the property of preserving regularity for string-rewriting systems -- Rewrite systems for natural, integral, and rational arithmetic -- D-bases for polynomial ideals over commutative noetherian rings -- On the word problem for free lattices -- A total, ground path ordering for proving termination of AC-rewrite systems -- Proving innermost normalisation automatically -- Termination of context-sensitive rewriting -- A new parallel closed



condition for Church-Rosser of left-linear term rewriting systems -- Innocuous constructor-sharing combinations -- Scott's conjecture is true, position sensitive weights -- Two-dimensional rewriting -- A complete axiomatisation for the inclusion of series-parallel partial orders -- Undecidability of the first order theory of one-step right ground rewriting -- The first-order theory of one step rewriting in linear noetherian systems is undecidable -- Solving linear Diophantine equations using the geometric structure of the solution space -- A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms -- Effective reduction and conversion strategies for combinators -- Finite family developments -- Prototyping combination of unification algorithms with the ELAN rule-based programming language -- The invariant package of MAS -- Opal: A system for computing noncommutative gröbner bases -- TRAM: An abstract machine for order-sorted conditional term rewriting systems.

Sommario/riassunto

This book constitutes the refereed proceedings of the 8th International Conference on Rewriting Techniques and Applications, RTA-97, held in Sitges, Spain, in June 1997. The 24 revised full papers presented were selected from a total of 54 submissions. Also included are abstracts of two invited talks and four system descriptions. Besides classical topics like termination, confluence, or applications to theorem proving, several new approaches to rewriting are presented. All in all, this volume presents the state of the art in the area of rewriting techniques and applications.