Conference Information

TLCA 2015: International Conference on Typed Lambda Calculi and Applications

Please Login to view website of conference
Free account: view official websites, track deadlines, and get email reminders.
Embed deadline badge
TLCA
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Submission Date:
2015-01-30
Notification Date:
2015-04-02
Conference Date:
2015-06-29
Location:
Warsaw, Poland
Years:
13
QUALIS: B1   Viewed: 26998   Tracked: 1   Attend: 0

Conference Partner Index (CP-I)

56.8 / 100
Ranked #739 of 5,680 conferences · Top 13%
Academic recognition (35%)
78
Submission selectivity (20%) No data - scored at the neutral baseline of 50
Editions held (20%)
71
Community attention (10%)
15
Public record completeness (15%)
25

Inputs used: Listed as QUALIS B1 · Editions on record: 13 · Researchers following it here: 1 · Researchers who opened this page in the past 24 months: 2

Missing from the public record: Historical acceptance rates (+4.5) · Past editions (+3.0) · Best-paper records (+2.3)
Organizers can add these from this page after claiming the conference; scores are recomputed nightly. How to raise this score

Confidence 80% - the share of the score backed by observed data rather than the neutral baseline. How this score is calculated · Browse the ranking · Algorithm version 1.1 · Computed 2026-09-12

Call For Papers

TLCA 2015 (International Conference on Typed Lambda Calculi and Applications) is a QUALIS B1 conference held in Warsaw, Poland on 2015-06-29. The paper submission deadline is 2015-01-30. Acceptance notifications are sent on 2015-04-02.

The 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015) is a forum for original research in the theory and applications of typed lambda calculus, broadly construed. Suggested, but not exclusive, list of topics for submission are: Proof-theory: natural deduction, sequent calculi, cut elimination and normalization, propositions as types, linear logic and proof nets, type-theoretic aspects of computational complexity. Semantics: denotational semantics, game semantics, realisability, domain theory, categorical models, higher order semantics of natural language. Types: subtypes, dependent types, polymorphism, inductive, coinductive and recursive types, intersection types and related approaches, type inference and type checking, types in program analysis and verification, types in proof assistants, homotopy type theory. Programming: foundational aspects of functional programming, object-oriented programming and other programming paradigms, calculi for higher order concurrency (e.g. pi-calculus), flow analysis of higher-type computation, program equivalence, program transformation and optimization. Other: typed lambda calculi in education, proof systems based on lambda calculus to teach mathematics, lambda calculi as a unified notation in scientific education. The TLCA serves as a forum for presenting original research in the theory and applications of typed lambda calculus, broadly construed.
Last updated by Dou Sun on

Related Conferences

Related Journals

CCFFull NameImpact FactorPublisherISSN
AIEEE Transactions on Multimedia9.7IEEE1520-9210
CKnowledge-Based Systems7.2Elsevier0950-7051
BSoftware & Systems Modeling3.2Springer1619-1366
AIEEE Transactions on Computers3.8IEEE0018-9340
CFuture Generation Computer Systems5.9Elsevier0167-739X
CNeurocomputing6.5Elsevier0925-2312
CPattern Recognition Letters3.9Elsevier0167-8655
BPattern Recognition7.6Elsevier0031-3203
IEEE Access3.6IEEE2169-3536
AIEEE Transactions on Dependable and Secure Computing7.5IEEE1545-5971

Comments 0

No comments yet.

Please Login to post a comment