{"cited_by_count":2354723,"description":"This cluster of papers covers a wide range of program analysis and verification techniques, including static analysis, formal verification, type inference, memory management, concurrency, garbage collection, separation logic, model checking, abstract interpretation, and programming language semantics.","display_name":"Logic, programming, and type systems","domain_id":"3","external_ids":{"openalex":"https://openalex.org/T10126","wikipedia":"https://en.wikipedia.org/wiki/Program_analysis"},"field_id":"17","id":"T10126","keywords":[{"display_name":"formal verification","id":"formal-verification","score":0.2191,"url":"https://openalex.org/keywords/formal-verification"},{"display_name":"program verification","id":"program-verification","score":0.6139,"url":"https://openalex.org/keywords/program-verification"},{"display_name":"object-oriented programming","id":"object-oriented-programming","score":0.2268,"url":"https://openalex.org/keywords/object-oriented-programming"},{"display_name":"programming languages","id":"programming-languages","score":0.317,"url":"https://openalex.org/keywords/programming-languages"},{"display_name":"type systems","id":"type-systems","score":0.8137,"url":"https://openalex.org/keywords/type-systems"},{"display_name":"functional programming","id":"functional-programming","score":0.6225,"url":"https://openalex.org/keywords/functional-programming"},{"display_name":"program transformation","id":"program-transformation","score":0.5158,"url":"https://openalex.org/keywords/program-transformation"},{"display_name":"programming language design","id":"programming-language-design","score":0.6123,"url":"https://openalex.org/keywords/programming-language-design"},{"display_name":"logic programming","id":"logic-programming","score":0.3153,"url":"https://openalex.org/keywords/logic-programming"},{"display_name":"program semantics","id":"programming-language-semantics","score":0.7248,"url":"https://openalex.org/keywords/programming-language-semantics"},{"display_name":"functional programming languages","id":"functional-programming-languages","score":0.7048,"url":"https://openalex.org/keywords/functional-programming-languages"},{"display_name":"lambda calculus","id":"lambda-calculus","score":0.7647,"url":"https://openalex.org/keywords/lambda-calculus"},{"display_name":"formal specification","id":"formal-specification","score":0.2056,"url":"https://openalex.org/keywords/formal-specification"},{"display_name":"operational semantics","id":"operational-semantics","score":0.5886,"url":"https://openalex.org/keywords/operational-semantics"},{"display_name":"automated theorem proving","id":"automated-theorem-proving","score":0.4629,"url":"https://openalex.org/keywords/automated-theorem-proving"},{"display_name":"type inference","id":"type-inference","score":0.8351,"url":"https://openalex.org/keywords/type-inference"},{"display_name":"process algebra","id":"process-calculus","score":0.5094,"url":"https://openalex.org/keywords/process-calculus"},{"display_name":"program analysis","id":"program-analysis","score":0.4129,"url":"https://openalex.org/keywords/program-analysis"},{"display_name":"abstract interpretation","id":"abstract-interpretation","score":0.6629,"url":"https://openalex.org/keywords/abstract-interpretation"},{"display_name":"formal semantics","id":"formal-semantics","score":0.229,"url":"https://openalex.org/keywords/formal-semantics"},{"display_name":"type theory","id":"type-theory","score":0.5969,"url":"https://openalex.org/keywords/type-theory"},{"display_name":"denotational semantics","id":"denotational-semantics","score":0.7343,"url":"https://openalex.org/keywords/denotational-semantics"},{"display_name":"garbage collection","id":"garbage-collection","score":0.4242,"url":"https://openalex.org/keywords/garbage-collection"},{"display_name":"programming language implementation","id":"programming-language-implementation","score":0.6276,"url":"https://openalex.org/keywords/programming-language-implementation"},{"display_name":"Prolog","id":"prolog","score":0.3072,"url":"https://openalex.org/keywords/prolog"}],"legacy_keywords":["Static Analysis","Formal Verification","Type Inference","Memory Management","Concurrency","Garbage Collection","Separation Logic","Model Checking","Abstract Interpretation","Programming Language Semantics"],"openalex_id":"https://openalex.org/T10126","source_created_date":"2024-01-23T15:27:05","source_updated_date":"2026-10-17T03:02:00","subfield_id":"1702","url":"/topics/T10126","works_api_url":"https://api.openalex.org/works?filter=topics.id:T10126","works_count":234969,"label":"Logic, programming, and type systems","provider":"openalex","revision":"e2bdd15196558634","taxonomy_revision":"f050b5d4780b1289","title":"Logic, programming, and type systems","kind":"topic-directory","aeo_cohort":"topic-directory","catalogue_revision":"f050b5d4780b1289","numeric_address":"36042853377543379","address_version":"morton4x16-v1","coordinates":[3,17,1702,10126],"answer_status":"Directory metadata; local answer requires separate source review","truth_status":"Subject descriptor, not a factual answer or a demonstrated knowledge gap","reviewed_answer":null}