Nissim Francez

According to our database1, Nissim Francez authored at least 135 papers between 1973 and 2018.

Collaborative distances :
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Diversification of Object-Languages for Propositional Logics.
Journal of Logic, Language and Information, 2018

2017
A Proof-Theoretic Semantics for Exclusion.
Logica Universalis, 2017

A Proof-Theoretic Semantics for Adjectival Modification.
Journal of Logic, Language and Information, 2017

On harmony and permuting conversions.
J. Applied Logic, 2017

A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object.
Proceedings of the 15th Meeting on the Mathematics of Language, 2017

2016
The Lambek Calculus Extended with Intuitionistic Propositional Logic.
Studia Logica, 2016

Views of proof-theoretic semantics: reified proof-theoretic meanings.
J. Log. Comput., 2016

Relevant harmony.
J. Log. Comput., 2016

Proof-Theoretic Semantics for Intensional Transitive Verbs.
J. Semantics, 2016

2015
On the Notion of Canonical Derivations from Open Assumptions and its Role in Proof-Theoretic Semantics.
Rew. Symb. Logic, 2015

On a Distinction of Two Facets of Meaning and its Role in Proof-theoretic Semantics.
Logica Universalis, 2015

Proof-Theoretic Reconstruction of Generalized Quantifiers.
J. Semantics, 2015

A proof-theoretic universal property of determiners.
J. Applied Logic, 2015

2014
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.
Studia Logica, 2014

Bilateral Relevant Logic.
Rew. Symb. Logic, 2014

Harmony in Multiple-Conclusion Natural-Deduction.
Logica Universalis, 2014

A Logic Inspired by Natural Language: Quantifiers As Subnectors.
J. Philosophical Logic, 2014

Bilateralism in Proof-Theoretic Semantics.
J. Philosophical Logic, 2014

A proof-theoretic semantics for contextual domain restriction.
J. Language Modelling, 2014

The Granularity of Meaning in Proof-Theoretic Semantics.
Proceedings of the Logical Aspects of Computational Linguistics, 2014

2012
Editors' Preface.
Studia Logica, 2012

A Note on Harmony.
J. Philosophical Logic, 2012

When are different type-logical semantic definitions defining equivalent meanings?
J. Comput. Syst. Sci., 2012

2011
Proof-Theoretic Semantic Values for Logical operators.
Rew. Symb. Logic, 2011

2010
Proof-Theoretic Semantics for Subsentential Phrases.
Studia Logica, 2010

Extending Free Pregroups with Lower Bounds.
Studia Logica, 2010

Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars.
Proceedings of the Time for Verification, 2010

2009
Proof-Theoretic Semantics for a Natural Language Fragment.
Proceedings of the Mathematics of Language, 10th and 11th Biennial Conference, 2009

2008
Game Semantics for the Lambek-Calculus: Capturing Directionality and the Absence of Structural Rules.
Studia Logica, 2008

Commutation-augmented pregroup grammars and push-down automata with cancellation.
Inf. Comput., 2008

2007
Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages.
Studia Logica, 2007

Pushdown automata with cancellation and commutation-augmented pregroups grammars.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
A 'Natural Logic' inference system using the Lambek calculus.
Journal of Logic, Language and Information, 2006

A Lambek Automaton.
Logic Journal of the IGPL, 2006

2005
Unification Grammars and Off-Line Parsability.
Journal of Logic, Language and Information, 2005

Lambek-Calculus with General Elimination Rules and Continuation Semantics.
Proceedings of the Logical Aspects of Computational Linguistics, 2005

2003
An algebraic characterization of deterministic regular languages over infinite alphabets.
Theor. Comput. Sci., 2003

Order-Based Inference in Natural Logic.
Logic Journal of the IGPL, 2003

2002
Guaranteeing Parsing Termination of Unification Grammars.
Proceedings of the 19th International Conference on Computational Linguistics, 2002

2000
The Algebraic Semantics of Interrogative NPs.
Grammars, 2000

Querying Temporal Databases Using Controlled Natural Language.
Proceedings of the COLING 2000, 18th International Conference on Computational Linguistics, Proceedings of the Conference, 2 Volumes, July 31, 2000

1999
Off-Line Parsability and the Well-Foundedness of Subsumption.
Journal of Logic, Language and Information, 1999

Similarity Preservation in Default Logic.
Ann. Math. Artif. Intell., 1999

1998
A Logic-Based Approach to Program Flow Analysis.
Acta Inf., 1998

A proof theory of asynchronously communicating sequential processes.
Proceedings of the Programming Concepts and Methods, 1998

Hypothetical Reasoning and Basic Non-constituent Coordination in Type-Logical Grammar.
Proceedings of the Logical Aspects of Computational Linguistics, 1998

System Demonstration Natural Language Generation With Abstract Machine.
Proceedings of the Ninth International Workshop on Natural Language Generation, 1998

1997
Splitting the Reference Time: The Analogy between Nominal and Temporal Anaphora Revisited1.
J. Semantics, 1997

Amalia - A Unified Platform for Parsing and Generation
CoRR, 1997

Off-line Parsability and the Well-foundedness of Subsumption
CoRR, 1997

On Fibring Feature Logics with Concatenation Logics.
Proceedings of the Logical Aspects of Computational Linguistics, 1997

1996
Parsing with Typed Feature Structures
CoRR, 1996

Parsing with Typed Feature Structures
CoRR, 1996

Automatic Translation of Natural Language System Specifications.
Proceedings of the Computer Aided Verification, 8th International Conference, 1996

Interacting processes - a multiparty approach to coordinated distributed processing.
Addison-Wesley, ISBN: 978-0-201-56528-7, 1996

1995
Contrastive Logic.
Logic Journal of the IGPL, 1995

Abstract Machine for Typed Feature Structures
CoRR, 1995

Splitting the Reference Time: Temporal Anaphora and Quantification in DRT
CoRR, 1995

Splitting the Reference Time: Temporal Anaphora and Quantification in DRT.
Proceedings of the EACL 1995, 1995

1994
Finite-State Unification Automata and Relational Languages
Inf. Comput., November, 1994

Finite-Memory Automata.
Theor. Comput. Sci., 1994

Program Composition via Unification.
Theor. Comput. Sci., 1994

Fairness in term rewriting systems.
Meth. of Logic in CS, 1994

Abstract Machine for Typed Feature Structures.
CoRR, 1994

1993
Fairness and Hyperfairness in Multi-Party Interactions.
Distributed Computing, 1993

1992
On Equivalence-Completions of Fairness Assumtions.
Formal Asp. Comput., 1992

Asynchronous Unison (Extended Abstract).
Proceedings of the 12th International Conference on Distributed Computing Systems, 1992

Program Composition via Unification.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Program verification.
International computer science series, Addison-Wesley, ISBN: 978-0-201-41608-4, 1992

1991
Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View".
Inf. Process. Lett., 1991

Program Composition and Modular Verification.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

Synchrony Loosening Transformations for Interacting Processes.
Proceedings of the CONCUR '91, 1991

1990
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett., 1990

Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett., 1990

Fairness and Hyperfairness in Multi-Party Interactions.
Proceedings of the Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, 1990

A Logic-Based Approach to Data Flow Analysis Problem.
Proceedings of the Programming Language Implementation and Logic Programming, 1990

On the Equivalence of Deferred Substitution and Immediate Substitution Semantics for Logic Programs.
Proceedings of the Logics in AI, European Workshop, 1990

Interacting processes: a language for coordinated distributed programming.
Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990

Conflict Propogation.
Proceedings of the 1990 Internation Conference on Computer Languages, 1990

Finite-Memory Automata (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Distributed Logic Programming.
Proceedings of the Parallelization in Inference Systems, 1990

Superimposition for Interacting Processes.
Proceedings of the CONCUR '90, 1990

1989
Fairness in Context-Free Grammars under Every Choice-strategy
Inf. Comput., March, 1989

Multiparty Interactions for Interprocess Communication and Synchronization.
IEEE Trans. Software Eng., 1989

Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Inf. Process. Lett., 1989

Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

1988
Infinite Trees, Markings and Well-Foundedness
Inf. Comput., November, 1988

Appraising Fairness in Languages for Distributed Programming.
Distributed Computing, 1988

A Compositional Approach to Superimposition.
Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

1987
Fairness and the axioms of control predicates.
International Journal of Parallel Programming, 1987

Appraising Fairness in Languages for Distributed Programming.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

1986
Script: A Communication Abstraction Mechanism and Its Verification.
Sci. Comput. Program., 1986

A Complete Rule for Equifair Termination.
J. Comput. Syst. Sci., 1986

A New Approach to Detection of Locally Indicative Stability.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

Infinite Trees, Markings and Well Foundedness.
Proceedings of the CAAP '86, 1986

Fairness.
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4612-4886-6, 1986

1985
Symmetric Intertask Communication.
ACM Trans. Program. Lang. Syst., 1985

An environment for logic programming.
SIGPLAN Notices, 1985

Script: A Communication Abstraction Mechanism.
Operating Systems Review, 1985

A Proof Rule for Fair Termination of Guarded Commands
Information and Control, 1985

Fairness in Context-Free Grammars under Canonical Derivations.
Proceedings of the STACS 85, 1985

Fairness in Term Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

Proving Termination of Prolog Programs.
Proceedings of the Logics of Programs, 1985

1984
Modeling the Distributed Termination Convention of CSP.
ACM Trans. Program. Lang. Syst., 1984

A Linear-History Semantics for Languages for Distributed Programming.
Theor. Comput. Sci., 1984

A Weakest Precondition Semantics for Communicating Processes.
Theor. Comput. Sci., 1984

Can Message Buffers Be Axiomatized in Linear Temporal Logic?
Information and Control, 1984

Generalized Fair Termination.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

Fail Termination of Communicating Processe.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

Proof Rules for Communication Abstractions (Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

1983
Extended Naming Conventions for Communicating Processes.
Sci. Comput. Program., 1983

Product Properties and Their Direct Verification.
Acta Inf., 1983

Distributed k-Selection: From a Sequential to a Distributed Algorithm.
Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983

Script: A Communication Abstraction Mechanism.
Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983

A Compete Proof Rule for Strong Equifair Termination.
Proceedings of the Logics of Programs, 1983

1982
Achieving Distributed Termination without Freezing.
IEEE Trans. Software Eng., 1982

Decomposition of Distributed Programs into Communication-Closed Layers.
Sci. Comput. Program., 1982

Fair Deriviations in Context-Free Grammars
Information and Control, 1982

Extended Naming Conventions for Communicating Processes.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

Can Message Buffers be Characterized in Linear Temporal Logic?
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

1981
An Experimental Implementation of CSP.
Proceedings of the 2nd International Conference on Distributed Computing Systems, 1981

1980
Distributed Termination.
ACM Trans. Program. Lang. Syst., 1980

A Proof System for Communicating Sequential Processes.
ACM Trans. Program. Lang. Syst., 1980

A Distributed Abstract Data Type Implemented by a Probabilistic Communication Scheme
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

A Linear History Semantics for Distributed Languages (Extended Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
Semantics of Nondeterminism, Concurrency, and Communication.
J. Comput. Syst. Sci., 1979

On Achieving Distributed Termination.
Proceedings of the Semantics of Concurrent Computation, 1979

1978
An Application of a Method for Analysis of Cyclic Programs.
IEEE Trans. Software Eng., 1978

A Proof Method for Cyclic Programs.
Acta Inf., 1978

Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
A Case for a Forward Predicate Transformer.
Inf. Process. Lett., 1977

Another Advantage of Keyword Notation for Parameter Communication with Subprograms.
Commun. ACM, 1977

Backtracking in Recursive Computations.
Acta Inf., 1977

1973
On the Non-Compactness of the Class of Program Schemas.
Inf. Process. Lett., 1973


  Loading...